#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10; 
int n, m, k, p[N], a[N], s[N], c[N], x[N], mx, id[N], mk[N];
long long ans, res[N];
int main() {
    freopen("vegetables.in", "r", stdin);
    freopen("vegetables.out", "w", stdout);
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> s[i] >> c[i] >> x[i];
        id[i] = i;
    }
    for (int i = 1; i <= k; i++) {
        cin >> p[i];
        mx = max(mx, p[i]);
    }
    sort(id + 1, id + 1 + n, [&](int u, int v) {
        return a[u] < a[v];
    });
    for (int i = 1, j = 1; i <= mx; i++) {
        for (int _ = 1; _ <= m; _++) {
            if (!c[id[j]]) j++;
            if (!mk[id[j]]) {
                ans += s[id[j]];
                mk[id[j]] = 1;
            }
            ans += a[id[j]];
            c[id[j]]--;
        }
        res[i] = ans;
        for (int i = 1; i <= n; i++) {
            c[i] = max(0, c[i]);
        }
    }
    for (int i = 1; i <= k; i++) {
        cout << res[p[i]] << '\n';
    }
    return 0;
}