#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,n) for(int i=s;i<=n;i++)
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define eb emplace_back
#define fi first
#define se second
#define tup pair<int, pii>
int n,m,a;
const int N = 3e5 + 5;
set<int> id[N];
vi need(N), ans(N,0);
void add(int l, int r, int k) {
rep(i,1,n) {
if(ans[i]!=0) continue;
auto itl = id[i].lower_bound(l), itr=id[i].upper_bound(r);
need[i] -= distance(itl, itr)*a;
if(need[i]<=0) ans[i] = k;
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
rep(i,1,m) {
int p; cin>>p;
id[p].insert(i);
}
rep(i,1,n) cin>>need[i];
int k; cin>>k;
rep(i,1,k) {
int l,r;
cin>>l>>r>>a;
if(l>r) {
add(l, m, i);
add(1, r, i);
} else add(l,r,i);
}
rep(i,1,n) {
if(ans[i]==0) cout << "NIE\n";
else cout << ans[i] << "\n";
}
return 0;
}
