#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 1e5 + 5;

int n, m, q;
int ans[N];
int a[N], V[N];
vector<int> p[N];
int L[N], R[N], C[N];

int last[N];
ll sum[N];

ll bit[N];
void upd(int pos, int x) {
    for (; pos <= m; pos += pos & -pos) bit[pos] += x;
}
ll que(int pos) {
    ll re = 0;
    for (; pos; pos -= pos & -pos) re += bit[pos];
    return re;
}
ll que(int l, int r) {
    return que(r) - que(l - 1);
}

void divide(int l, int r, vector<int> &ask) {
    if (l == r || ask.size() == 0) {
        for (int i : ask) ans[i] = l;
        return;
    }
    int mid = (l + r) / 2;
    vector<tuple<int, int, int>> op;
    vector<int> pos;
    for (int i = l; i <= mid; i++) {
        op.emplace_back(L[i], L[i], C[i]);
        op.emplace_back(R[i] + 1, L[i], -C[i]);
    }
    for (int i : ask) pos.insert(pos.end(), p[i].begin(), p[i].end());
    sort(op.begin(), op.end());
    sort(pos.begin(), pos.end());
    int cur = 0;
    for (int i : pos) {
        while (cur < op.size() && get<0>(op[cur]) <= i) {
            upd(get<1>(op[cur]), get<2>(op[cur]));
            cur++;
        }
        sum[a[i]] += que(last[a[i]] + 1, i);
        last[a[i]] = i;
    }
    vector<int> askl, askr;
    for (int i : ask) {
        if (sum[i] >= V[i]) askl.emplace_back(i);
        else {
            V[i] -= sum[i];
            askr.emplace_back(i);
        }
        last[i] = sum[i] = 0;
    }
    ask.clear();
    for (int i = 0; i < cur; i++) upd(get<1>(op[i]), -get<2>(op[i]));
    divide(l, mid, askl);
    divide(mid + 1, r, askr);
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++) cin >> a[i], p[a[i]].emplace_back(i);
    for (int i = 1; i <= n; i++) cin >> V[i];
    for (int i = 1; i <= q; i++) cin >> L[i] >> R[i] >> C[i];
    vector<int> ask(n);
    iota(ask.begin(), ask.end(), 1);
    divide(1, q + 1, ask);
    for (int i = 1; i <= n; i++) {
        if (ans[i] == q + 1) ans[i] = -1;
        cout << ans[i] << '\n';
    }
}