441A - Valera and Antique Items - CodeForces Solution

#include <bits/stdc++.h>
#include <iostream>
using namespace std;

#define int long long
#define toggle(x) (x = !x)
#define fl(i, a, b) for(int i=a;i<b;i++)
#define sort_(v) sort(v.begin(), v.end())
#define reverse_sort(v) sort(v.begin(),v.end(), greater<int>())
#define exchange(x) (x *= -1)
#define endl "\n"
const int mod = 1e9 + 7;

clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}

//check if test cases is mentioned or not
void solve() {
	int n, v;
	cin>>n>>v;

	int count =0;
	set<int> res;
	for(int i=1;i<=n;i++) {
		int k;
		cin>>k;
		for(int j=1;j<=k;j++) {
			int a;
			cin>>a;
			if(v > a) {
				count++;
				res.insert(i);
			}
		}
	}
	cout<<res.size()<<endl;
	for(auto it: res) {
		cout<<it<<" ";
	}
}

int32_t main()
{
	startTime = clock();
	
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t=1;
	// cin>>t;
	while(t--) {
		solve();
	}
	return 0;
}