// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 100005;

int n, m, k;
int a[MAXN], s[MAXN], c[MAXN], x[MAXN];

struct Edge {
    int v, flow, cap, cost, rid;
};
const int MAXSZ = 10000005;
vector<Edge> adj[MAXSZ];
void addEdge(int u, int v, int cap, int cost) {
    //cerr << ' ' << u << " -> " << v << ": " << cap << ' ' << cost << '\n';
    int id = SZ(adj[u]), rid = SZ(adj[v]);
    adj[u].pb({v, 0, cap, cost, rid});
    adj[v].pb({u, 0, 0, -cost, id});
}
bool inq[MAXSZ];
int p[MAXSZ];
ll d[MAXSZ];
queue<int> qu;
ll spfa(int src, int sink) {
    REP (i, 0, sink + 1) {
        d[i] = LINF;
    }
    d[src] = 0;
    qu.push(src);
    inq[src] = 1;
    while (!qu.empty()) {
        int u = qu.front(); qu.pop();
        inq[u] = 0;
        for (auto [v, flow, cap, cost, rid] : adj[u]) {
            if (flow == cap) {
                continue;
            }
            if (mnto(d[v], d[u] + cost)) {
                p[v] = rid;
                if (!inq[v]) {
                    inq[v] = 1;
                    qu.push(v);
                }
            }
        }
    }
    return d[sink] < 0;
}
pll mcmf(int src, int sink) {
    int flow = 0;
    ll cost = 0;
    while (spfa(src, sink)) {
        int v = sink;
        int cflow = INF;
        while (v != src) {
            int rid = p[v];
            int u = adj[v][rid].v, id = adj[v][rid].rid;
            mnto(cflow, adj[u][id].cap - adj[u][id].flow);
            v = u;
        }
        assert(cflow != 0);
        flow += cflow;
        v = sink;
        while (v != src) {
            int rid = p[v];
            int u = adj[v][rid].v, id = adj[v][rid].rid;
            cost += (ll) cflow * adj[u][id].cost;
            adj[u][id].flow += cflow;
            adj[v][rid].flow -= cflow;
            v = u;
        }
    }
    return {flow, cost};
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m >> k;
    REP (i, 0, n) {
        cin >> a[i] >> s[i] >> c[i] >> x[i];
    }
    while (k--) {
        int p; cin >> p;
        int ptr = n + p;
        REP (i, 0, n) {
            int tc = c[i];
            REP (j, 0, p) {
                if (tc == 0) {
                    break;
                }
                int mn = min(tc, x[i]);
                if (j + 1 == p) {
                    mn = tc;
                }
                addEdge(i, ptr, mn, 0);
                addEdge(ptr, j + n, m, 0);
                if (j) {
                    addEdge(ptr, ptr - 1, c[i], 0);
                }
                ptr++;
                tc -= mn;
            }
        }
        assert(ptr < MAXSZ);
        int src = ptr, sink = src + 1;
        REP (i, 0, n) {
            if (c[i] == 0) {
                continue;
            }
            addEdge(src, i, 1, -s[i] - a[i]);
            if (c[i] > 1) {
                addEdge(src, i, c[i] - 1, -a[i]);
            }
        }
        REP (i, 0, p) {
            addEdge(i + n, sink, m, 0);
        }
        auto [flow, cost] = mcmf(src, sink);
        cout << -cost << '\n';
        REP (j, 0, sink + 1) {
            adj[j].clear();
        }
    }
    return 0;
}