//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

int calc () {
    string str;
    cin >> str;
    re (str[0] - '0') * 600 + (str[1] - '0') * 60 + stoi(str.substr(3, 2));
}

int main() {
    int n1, n2, n3, c1, c2, t;
    cin >> n1 >> c1 >> n2 >> t >> c2 >> n3;
    int k, time;
    int ans = 0;
    cin >> k;
    while (k--) {
        time = calc();
        if (time <= 6) continue;
        ans += (time + 59) / 60;
    }
    cout << "Basic:     " << n1 + ans * c1 << endl;
    cout << "Combined:  " << n2 + max(0, ans - t) * c2 << endl;
    cout << "Unlimited: " << n3 << endl;
}