#include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define ll long long
const int mx = 3e5 + 5;
int n, m, q, targ[mx], ans[mx]; ll bit[mx]; vector<int> pos[mx]; array<int, 3> Q[mx];
void upd(int i, int val){
for (; i < mx; i += i & (-i)) bit[i] += val;
}
void rupd(int l, int r, int val){
if (l <= r) upd(l, val), upd(r + 1, -val);
else rupd(l, m, val), rupd(1, r, val);
}
ll qry(int i){
ll ret = 0;
for (; i > 0; i -= i & (-i)) ret += bit[i], ret = min(ret, (ll)1e9); //avoid overflow
return ret;
}
void pbs(int l, int r, vector<pair<int, ll>> states){
if (l == r or states.empty()){
for (auto [i, _] : states) ans[i] = l;
return;
}
int mid = (l + r) / 2; vector<pair<int, ll>> L, R;
FOR(i, l, mid + 1) rupd(Q[i][0], Q[i][1], Q[i][2]);
for (auto [i, initVal] : states){
ll sm = initVal;
for (int p : pos[i]) sm += qry(p);
(sm >= targ[i]) ? L.push_back({i, initVal}) : R.push_back({i, sm});
}
FOR(i, l, mid + 1) rupd(Q[i][0], Q[i][1], -Q[i][2]);
pbs(l, mid, L); pbs(mid + 1, r, R);
}
int main(){
cin >> n >> m;
FOR(i, 1, m + 1){ int x; cin >> x; pos[x].push_back(i); }
FOR(i, 1, n + 1) cin >> targ[i];
cin >> q;
FOR(i, 1, q + 1) cin >> Q[i][0] >> Q[i][1] >> Q[i][2];
vector<pair<int, ll>> all;
FOR(i, 1, n + 1) all.push_back({i, 0});
pbs(1, q + 1, all);
FOR(i, 1, n + 1) cout<<(ans[i] <= q ? to_string(ans[i]) : "NIE")<<"\n";
}
