//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define tm (tl + tr >> 1)
#define ls tl, tm
#define rs tm + 1, tr
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 3e5 + 1;
int sz, root[N], n, m;
struct node {
ll sum;
int l, r;
node() : sum(0), l(0), r(0) {}
} t[2 * N];
void build(int &v, int tl = 1, int tr = m) {
if (!v) v = ++sz;
if (tl == tr) return;
build(t[v].l, ls);
build(t[v].r, rs);
}
void upd(int pos, int val, int v1, int &v2, int tl = 1, int tr = m) {
if (v1 != v2 || tl != 1 || tr != m) v2 = ++sz;
if (tl == tr) {
t[v2].sum = t[v1].sum + val;
return;
}
if (pos <= tm) {
t[v2].r = t[v1].r;
upd(pos, val, t[v1].l, t[v2].l, ls);
} else {
t[v2].l = t[v1].l;
upd(pos, val, t[v1].r, t[v2].r, rs);
}
int lv = t[v2].l, rv = t[v2].r;
t[v2].sum = t[lv].sum + t[rv].sum;
}
ll res = 0;
void get(int r, int v, int tl = 1, int tr = m) {
if (r < tl) return;
if (tr <= r) {
res += t[v].sum;
return;
}
get(r, t[v].l, ls);
get(r, t[v].r, rs);
}
int nd[N];
vector <int> pos[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int x;
for (int i = 1; i <= m; i++) {
cin >> x;
pos[x].pb(i);
}
for (int i = 1; i <= n; i++) {
cin >> nd[i];
}
int k;
cin >> k;
build(root[0]);
int l, r;
for (int i = 1; i <= k; i++) {
cin >> l >> r >> x;
if (l > r) {
upd(1, x, root[i - 1], root[i]);
upd(r + 1, -x, root[i], root[i]);
upd(l, x, root[i], root[i]);
continue;
}
upd(l, x, root[i - 1], root[i]);
if (r < m) upd(r + 1, -x, root[i], root[i]);
}
int m;
for (int i = 1; i <= n; i++) {
l = 1;
r = k;
while (l <= r) {
m = l + r >> 1;
res = 0;
for (int it: pos[i]) {
get(it, root[m]);
}
if (res >= nd[i]) r = m - 1;
else l = m + 1;
}
if (l > k) cout << "NIE\n";
else cout << l << '\n';
}
}
