#include<cstdio>
using namespace std;
#define	fcl	fclose(stdin);	fclose(stdout);	return 0
	#define	SUBMIT 2333
typedef long long LL;
LL prime[7]={0,10007,10039,10111,10181,10301};
LL n,m;
LL A[7][110];
LL Target[1000010];

int main(){
	#ifdef SUBMIT
	freopen("equationa.in","r",stdin);
	freopen("equationa.out","w",stdout);
	#endif
	scanf("%lld%lld",&n,&m);
	char ch;	bool flag=false;
	for(LL i=n;i>=0;--i){
		while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
		if(ch=='-')	flag=true;
		else{
			flag=false;
			for(int j=1;j<=5;++j){
				A[j][i]=ch-'0';
			}
		}
		while(ch=getchar(),ch>='0'&&ch<='9'){
			for(int j=1;j<=5;++j){
				A[j][i]=(A[j][i]*10%prime[j]+ch-'0')%prime[j];
			}
		}
		if(flag){
			for(int j=1;j<=5;++j){
				A[j][i]=prime[j]-A[j][i];
			}
		}
	}
	LL v;
	for(int j=1;j<=5;++j){
		for(LL x=1;x<=prime[j];++x){
			v=A[j][0];
			for(LL i=1;i<=n;++i){
				v=((v*x)%prime[j]+A[j][i])%prime[j];
			}
			if(v==0){
				for(LL i=x;i<=m;i+=prime[j]){
					Target[i]++;
				}
			}
		}
	}
	LL ANS=0;
	for(LL i=1;i<=m;++i){
		if(Target[i]==5){
			ANS++;
		}
	}
	printf("%lld\n",ANS);
	for(LL i=1;i<=m;++i){
		if(Target[i]==5){
			printf("%lld\n",i);
		}
	}
	#ifndef SUBMIT
	getchar();	getchar();
	#endif
	fcl;
}