Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Valera and Antique Items

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputValera is a collector. Once he wanted to expand his collection with exactly one antique item.

Valera knows *n* sellers of antiques, the *i*-th of them auctioned *k*_{i} items. Currently the auction price of the *j*-th object of the *i*-th seller is *s*_{ij}. Valera gets on well with each of the *n* sellers. He is perfectly sure that if he outbids the current price of one of the items in the auction (in other words, offers the seller the money that is strictly greater than the current price of the item at the auction), the seller of the object will immediately sign a contract with him.

Unfortunately, Valera has only *v* units of money. Help him to determine which of the *n* sellers he can make a deal with.

Input

The first line contains two space-separated integers *n*, *v* (1 ≤ *n* ≤ 50; 10^{4} ≤ *v* ≤ 10^{6}) — 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^{4} ≤ *s*_{ij} ≤ 10^{6}) — 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*_{1}, *q*_{2}, ..., *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.

Examples

Input

3 50000

1 40000

2 20000 60000

3 10000 70000 190000

Output

3

1 2 3

Input

3 50000

1 50000

3 100000 120000 110000

3 120000 110000 120000

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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/28/2017 22:13:15 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|