It's winter on the farm, and that means snow! There are n tiles on the path from the farmhouse to the barn, conveniently numbered 1..n, and tile i is covered in fi feet of snow.

In his farmhouse cellar, Farmer John has b pairs of boots, numbered 1..b. Some pairs are more heavy-duty than others, and some pairs are more agile than others. In particular, pair i lets FJ step in snow at most si feet deep, and lets FJ move at most di forward in each step.

Farmer John starts off on tile 1 and must reach tile n to wake up the cows. Tile 1 is sheltered by the farmhouse roof, and tile n is sheltered by the barn roof, so neither of these tiles has any snow. Help Farmer John determine which pairs of snow boots will allow him to make the trek.

Input

The first line contains two space-separated integers n and b (1 ≤ n, b ≤ 105).

The second line contains n space-separated integers; the i-th integer is fi, the depth of snow on tile i (0 ≤ fi ≤ 109). It's guaranteed that f1 = fn = 0.

The next b lines contain two space-separated integers each. The first integer on line i + 2 is si, the maximum depth of snow in which pair i can step. The second integer on line i + 2 is di, the maximum step size for pair i. It's guaranteed that 0 ≤ si ≤ 109 and 1 ≤ di ≤ n − 1.

Output

Prinr b lines. Line i should contain a single integer: 1 if Farmer John can trek from tile 1 to tile n wearing the i-th pair of boots, and 0 otherwise.