//gm --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long
using namespace std;
const int N=2e6+7;
const int mod=998244353;
// const int inf=2e18;
int n, m, k;
int l[N], r[N], a[N], o[N], w[N];
int L[N], R[N], ans[N], temp[N];
void add(int ind){
if(l[ind] <= r[ind]){
for(int i=l[ind]; i <= r[ind]; i++)temp[o[i]]+=a[ind];
}
else{
for(int i=l[ind]; i <= m; i++)temp[o[i]]+=a[ind];
for(int i=1; i <= r[ind]; i++)temp[o[i]]+=a[ind];
}
}
void AlemAmenov(){
cin >> n >> m;
for(int i=1; i <= m; i++){
cin >> o[i];
}
for(int i=1; i <= n; i++){
cin >> w[i];
}
cin >> k;
for(int i=1; i <= k; i++){
cin >> l[i] >> r[i] >> a[i];
}
for(int i=1; i <= n; i++){
L[i]=1;
R[i]=k;
}
for(int op=1; op < 20; op++){
vector<pii>v;
for(int i=1; i <= n; i++)v.pb({(L[i]+R[i])/2, i}), temp[i]=0;
sort(all(v));
int cur=1;
for(auto [m, ind] : v){
while(cur <= m)add(cur++);
if(temp[ind] >= w[ind]){
R[ind] = m-1;
ans[ind] = m;
}else{
L[ind] = m+1;
}
}
}
for(int i=1; i <= n; i++){
if(ans[i])cout << ans[i] << '\n';
else cout << "NIE\n";
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int RealName=1;
// cin >> RealName;
// freopen("connect.in", "r", stdin);
// freopen("connect.out", "w", stdout);
while(RealName--)
AlemAmenov();
return 0;
}
