#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int p=10007,q=100000007;
int n,m,i,cnt,ans[1000003],v[p],y;
ll a[103],b[103],aa,bb;
char c;
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1p2)?EOF:p1++;
}
inline int read(){
int x=0,fl=1;char ch=gc();
for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
return xfl;
}
inline bool f(int p,int M,ll t){
ll x=t[n];
for (int i=n-1;i>=0;i--) x=(xp+t[i])%M;
return x0;
}
inline void wri(int a){if(a<0)a=-a,putchar('-');if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(int a){wri(a);puts("");}
int main(){
n=read();m=read();
for (i=0;i<=n;i++){
aa=0,bb=0;
for (c=gc(),y=0;c<48 || 57<c;c=gc()) if (c'-') y=1;
for (;48<=c && c<=57;c=gc()) aa=((aa<<3)+(aa<<1)+(c48))%p,bb=((bb<<3)+(bb<<1)+(c48))%q;
a[i]=y?p-aa:aa;
b[i]=y?q-bb:bb;
}
for (i=0;i<p;i++)
if (f(i,p,a)) v[i]=1;
for (i=1;i<=m;i++)
if (v[i%p] && f(i,q,b)) ans[cnt++]=i;
wln(cnt);
for (i=0;i<cnt;i++) wln(ans[i]);
return 0;
}
//看完请点关注
