CodeForces 252A-Valera and Antique Items

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<memory.h>#include<map>#include<queue>#include <deque>#include <list>#include <ctime>#include <stack>#include <vector>#include<set>#define Maxntypedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;i++)#define per(i,j,k) for(int i=j;i>=k;--i)#define lowbit(a) a&-a#define Max(a,b) a>b?a:b#define Min(a,b) a>b?b:aconst int inf = 0x3f3f3f3f;const double pi = acos(-1.0);using namespace std;int kk[55];int main(){   int n,k,v,x,t=0,sum=0;scanf("%d%d",&n,&v);    bool flag;    rep(i,1,n)    {scanf("%d",&k);     flag=false;     rep(j,1,k)     { scanf("%d",&x);         if(v>x)        flag=true;     }     if(flag) kk[++t]=i;    }   printf("%d\n",t);   rep(p,1,t)   printf("%d%c",kk[p],(p<t?' ':'\n'));    return 0;}