# Valera and Antique Items

## 题意翻译

# 题目大意 有n个古董卖家，第i个卖家有ki个古董要拍卖。当前知道第i个卖家的第j件古董的拍卖价格为sij，一个人和n个卖家的关系都比较好，他非常确定只要他出价高于第i个卖家的古董之一的当前价格，第i个卖家就会和他达成协议。但不幸的是，当前他仅仅只有v单位的钱了。 问：他当前能和几个卖家达成协议，分别是哪几个(卖家按照标号呈上升序列给出)？ #### --Yiyang2006

## 题目描述

Valera 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.

## 输入输出格式

### 输入格式

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.

### 输出格式

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.

## 输入输出样例

### 输入样例 #1

``````3 50000
1 40000
2 20000 60000
3 10000 70000 190000
``````

### 输出样例 #1

``````3
1 2 3
``````

### 输入样例 #2

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

### 输出样例 #2

``````0

``````

## 说明

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.