Mirko is monitoring a construction site. He monitors buildings enumerated from to , starting from the left. For each building, he knows the current number of floors and the number of floors built on each day. He needs to know the answer to queries. The answer to each query is the index of the tallest building after days, as defined by the query. Your task is to help Mirko find the answers to these queries.
Input Format
The first line consists of the numbers and . The second line consists of integers, where the integer represents the initial height of the building. The third line consists of integers, where the integer represents the number of floors erected in one day for the building. The following lines consist of the integer, , representing the day in the query.
Output Format
For each query, output one number which represents the index of the tallest building after days. If there is more than one building, output the building with the greatest index in the input array (with indexes starting at 1).
Constraints
- Every other integer in the input will fit in a 32-bit signed integer. And they will be non-negative integers.
Sample Input
3 6
7 5 1
1 2 3
0
1
2
3
4
5
Sample Output
1
1
2
2
3
3
Explanation
Query #1: The height at the end of the day will be . Here, the building is the tallest.
Query #2: The height at the end of the day will be . Here, the building is the tallest.
Query #3: The height at the end of day will be . Here, the and buildings are the tallest, while the is the larger index.
Query #4: The height at the end of day will be . Here, the building is the tallest.
Query #5: The height at the end of day will be . Here, the and buildings are the tallest, while the is the larger index.
Query #6: The height at the end of day will be . Here, the building is the tallest.
Tested by Ray Williams Robinson Valiente