METEORS  Meteors
Byteotian Interstellar Union (BIU) has recently discovered a new planet in a nearby galaxy. The planet is unsuitable for colonisation due to strange meteor showers, which on the other hand make it an exceptionally interesting object of study.
The member states of BIU have already placed space stations close to the planet's orbit. The stations' goal is to take samples of the rocks flying by. The BIU Commission has partitioned the orbit into sectors, numbered from to , where the sectors and are adjacent. In each sector there is a single space station, belonging to one of the member states.
Each state has declared a number of meteor samples it intends to gather before the mission ends. Your task is to determine, for each state, when it can stop taking samples, based on the meter shower predictions for the years to come.
Input
The first line of the standard input gives two integers, and (), separated by a single space, that denote, respectively, the number of BIU member states and the number of sectors the orbit has been partitioned into.
In the second line there are integers (), separated by single spaces, that denote the states owning stations in successive sectors.
In the third line there are integers (), separated by single spaces, that denote the numbers of meteor samples that the successive states intend to gather.
In the fourth line there is a single integer () that denotes the number of meteor showers predictions. The following lines specify the (predicted) meteor showers chronologically. The th of these lines holds three integers , , (separated by single spaces), which denote that a meteor shower is expected in sectors (if ) or sectors (if ), which should provide each station in those sectors with meteor samples ().
Output
Your program should print lines on the standard output. The th of them should contain a single integer , denoting the number of shower after which the stations belonging to the th state are expected to gather at least samples, or the word NIE (Polish for no) if that state is not expected to gather enough samples in the foreseeable future.
Example
For the input data:
3 5 1 3 2 1 3 10 5 7 3 4 2 4 1 3 1 3 5 2
the correct result is:
3 NIE 1
hide comments
nandonathaniel:
20190215 12:55:28
Range Update :


zagymbef:
20190111 17:15:36
You guys can look through my code a little bit ^^: [[spoiler /!\ read the notes below]] Last edit: 20190114 13:50:28 

Mostafa Saad:
20181104 15:18:33
In case you can't read the text, here is the original problem:


userhacker_1:
20180319 22:02:11
testcases is true..... suppose we have k=300000 and n=1 and m=300000 and in all k query we have l=1 and r=300000 and a(i)=10^9 ... now i want know sum of all sector for one BIU member state in last k=300000 so ans is =


sinh_ngu_10i:
20180126 03:15:48
Is test case wrong? Why long long got WA? 

lukamercep:
20170830 10:53:36
long long int > WA


Jose Guerra Carmenate:
20170216 05:44:19
The text of the problem has errors !!! Please check it!!! 

mohammadjavad:
20161102 19:42:32
why my solution in O(n log^2 n) get TLE :( Last edit: 20161102 19:42:45 

:D:
20161012 01:20:52
It can be solved in O((m+k)*log(k)) (assuming n <= m). 

nib:
20160929 21:04:17
Beware that values can overflow long long int. 
Added by:  Krzysztof Lewko 
Date:  20111220 
Time limit:  0.101s1.540s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  XVIII POI 3rd stage 