Valera and Antique Items

Description:

Input:

The first line contains two space-separated integers n, v (1 ≤ n ≤ 50; 10⁴ ≤ v ≤ 10⁶) — the number of sellers and the units of money the Valera has.

Then n lines follow. The i-th line first contains integer k_i (1 ≤ k_i ≤ 50) the number of items of the i-th seller. Then go k_i space-separated integers s_i1, s_i2, ..., s_iki (10⁴ ≤ s_ij ≤ 10⁶) — the current prices of the items of the i-th seller.

Output:

In the first line, print integer p — the number of sellers with who Valera can make a deal.

In the second line print p space-separated integers q₁, q₂, ..., q_p (1 ≤ q_i ≤ n) — the numbers of the sellers with who Valera can make a deal. Print the numbers of the sellers in the increasing order.

Sample Input:

3 50000
1 40000
2 20000 60000
3 10000 70000 190000

Sample Output:

3
1 2 3

Sample Input:

3 50000
1 50000
3 100000 120000 110000
3 120000 110000 120000

Sample Output:

0

Note:

In the first sample Valera can bargain with each of the sellers. He can outbid the following items: a 40000 item from the first seller, a 20000 item from the second seller, and a 10000 item from the third seller.

In the second sample Valera can not make a deal with any of the sellers, as the prices of all items in the auction too big for him.