Ostap Bender recently visited frog farm and was inspired to create his own frog game.

Number of frogs are places on a cyclic gameboard, divided into m cells. Cells are numbered from 1 to m, but the board is cyclic, so cell number 1 goes right after the cell number m in the direction of movement. i-th frog during its turn can jump for a_i cells.

Frogs move in turns, game starts with a move by frog 1. On its turn i-th frog moves a_i cells forward, knocking out all the frogs on its way. If there is a frog in the last cell of the path of the i-th frog, that frog is also knocked out. After this the value a_i is decreased by the number of frogs that were knocked out during this turn. If a_i is zero or goes negative, then i-th frog doesn't make moves anymore.

After frog number 1 finishes its turn, frog number 2 starts to move, then frog number 3 and so on. After the frog number n makes its move, frog 1 starts to move again, then frog 2 and so on this process goes forever. If some frog was already knocked out from the board, we consider that it skips all its moves.

Help Ostap to identify, what frogs will stay on the board at the end of a game?

First line of the input contains two integers n and m (1 ≤ n ≤ 100000, 1 ≤ m ≤ 10⁹, n ≤ m) — number of frogs and gameboard size, respectively.

Following n lines contains frogs descriptions — two integers p_i and a_i (1 ≤ p_i, a_i ≤ m) — the number of cell occupied by i-th frog initially and initial jump length. All p_i are guaranteed to be distinct.

In the first line output number of frogs on the final gameboard. In the second line output their numbers in any order.