#include <bits/stdc++.h>
template <class T>
struct BIT
{
int n;
std::vector<T> a;
BIT(int m) : n(1+m), a(2+m) {}
void inc(int p, T x) { for (++p; p <= n; p+=p&-p) a[p] += x; }
auto qry(int p, T z = 0) { for (++p; p; p-=p&-p) z+=a[p]; return z;}
};
int main()
{
int n_state, n_sector, n_meteor;
scanf("%d%d", &n_state, &n_sector);
std::vector<std::vector<int>> states(n_state);
std::vector<int> sample(n_state), ans(n_state, -1);
for (int owner, i = 1; i <= n_sector; ++i)
scanf("%d", &owner), states[--owner].push_back(i);
for (int &x : sample) scanf("%d", &x);
scanf("%d", &n_meteor);
std::vector<std::tuple<int, int, int>> meteors(n_meteor);
for (auto &[l, r, a] : meteors) scanf("%d%d%d", &l, &r, &a);
BIT<int64_t> fw(n_sector + 20000);
std::function<void(int, int, std::vector<int>&)> parallel_bs = [&](int l, int r, std::vector<int> &candi) {
if (candi.empty()) return;
auto m = l + (r-l)/2;
for (int i = l; i <= m; ++i) {
auto [ml, mr, ma] = meteors[i];
fw.inc(ml, ma);
fw.inc(mr + 1, -ma);
if (ml > mr) fw.inc(1, ma), fw.inc(n_sector + 1, -ma);
}
std::vector<int> ok, not_ok;
for (auto c : candi) {
uint64_t sum = 0;
for (auto st : states[c]) sum += fw.qry(st);
if (sum >= sample[c]) ok.push_back(c), ans[c] = m;
else not_ok.push_back(c), sample[c] -= sum;
}
for (int i = l; i <= m; ++i) {
auto [ml, mr, ma] = meteors[i];
ma *= -1;
fw.inc(ml, ma);
fw.inc(mr + 1, -ma);
if (ml > mr) fw.inc(1, ma), fw.inc(n_sector + 1, -ma);
}
if (l != r)
{
parallel_bs(l, m, ok); std::vector<int>().swap(ok);
parallel_bs(m+1, r, not_ok); std::vector<int>().swap(not_ok);
}
};
std::vector<int> all(n_state);
std::iota(all.begin(), all.end(), 0);
parallel_bs(0, n_meteor - 1, all);
for (int i = 0; i < n_state; ++i)
{
if (ans[i] == -1) puts("NIE");
else printf("%d\n", ans[i] + 1);
}
return 0;
}
