#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

## Problem Description

Hearing that a faster computer will allow you to compile code faster, Takahashi decides to buy a new computer to increase his AtCoder ranking.

Takahashi has a list of * N *computers that he is considering to buy. The

*-th computer has a price*

**i***yen (the currency of Japan) and is arranged such that the computers are sorted in decreasing order of how much Takahashi prefers it.*

**P**_{i}Takahashi has * Q *queries. In the

*-th query, he wants to know what the best computer he can buy with*

**i***yen is. So print out the index of that computer. If he cannot buy any of the computers, print -1.*

**M**_{i}## Input

The first line of input will contain two integers, **N** and **Q**.

The next line of input will contain * N *space-seperated integers,

*,*

**P**_{1}*...*

**P**_{2 }*.*

**P**_{N}The following line of input will contain * Q* space-seperated integers,

*,*

**M**_{1}*...*

**M**_{2 }*.*

**M**_{Q}## Output

The output should contain a single line of * Q* space-seperated integers, answering each query.

## Limits

For all subtasks: 1 ≤ * N*,

*≤ 100000, 1 ≤*

**Q***,*

**P**_{i}*≤ 10*

**M**_{i}^{18}

Subtask 1 (25%): * N*,

*≤ 1000.*

**Q**Subtask 2 (75%): No additional constraints.

Subtask 3 (0%): Sample test cases.

## Sample Input

5 7

9 4 6 3 2

3 1 4 1 5 9 2

## Sample Output

4 -1 2 -1 2 1 5

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 25 | 12 | 0.2s | 16MB | Minimum |

2 | 75 | 22 | 0.2s | 16MB | Minimum |

3 | 0 | 1 | 0.2s | 16MB | Minimum |

### Judge Compile Command

g++-7 ans.cpp -o buycomputer -Wall -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512