#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
using namespace std;
const long long oo = 1000000000000000000;
long long int sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
freopen ( "sum.in", "r", stdin )
*/
int mp[ 300001 ];
int main () {
int n, m;
cin >> n >> m;
int a[ m + 1 ];
for ( int i = 1; i <= m; i ++ )
cin >> a[ i ];
int b[ n + 1 ];
for ( int i = 1; i <= n; i ++ ) {
cin >> b[ i ];
}
int q, l, r, x;
cin >> q;
while ( q -- ) {
num ++;
cin >> l >> r >> x;
if ( l > r ) {
for ( int i = l; i <= m; i ++ ) {
if ( b[ a[ i ] ] <= 0 )
continue;
b[ a[ i ] ] -= x;
if ( b[ a[ i ] ] <= 0 )
mp[ a[ i ] ] = num;
}
for ( int i = 1; i <= r; i ++ ) {
if ( b[ a[ i ] ] <= 0 )
continue;
b[ a[ i ] ] -= x;
if ( b[ a[ i ] ] <= 0 )
mp[ a[ i ] ] = num;
}
}
else {
for ( int i = l; i <= r; i ++ ) {
if ( b[ a[ i ] ] <= 0 )
continue;
b[ a[ i ] ] -= x;
if ( b[ a[ i ] ] <= 0 )
mp[ a[ i ] ] = num;
}
}
}
for ( int i = 1; i <= n; i ++ ) {
if ( !mp[ i ] )
cout << "NIE\n";
else
cout << mp[ i ] << "\n";
}
}
