#include<bits/stdc++.h>
#define il inline
#define ll long long
#define rep(i,a,b,k) for(register ll i=a;i<=b;i+=k)
#define drep(i,a,b,k) for(register ll i=a;i>=b;i-=k)
using namespace std;
const int mod=1e9+7;
int n,m,a[105],ans,res[1000005];
bool flag;
il bool cal(ll x)
{
	ll sum=0;
	drep(i,n,1,1)
		sum=((a[i]+sum)*x)%mod;
	sum=(sum+a[0])%mod;
	return !sum;
} 
int main()
{
	scanf("%d%d",&n,&m);
	rep(i,0,n,1)
		scanf("%d",&a[i]);
	rep(i,1,m,1)
		if(cal(i))
		{
			ans++;
			res[ans]=i;
			flag=1;
		}
	if(!flag)
	{
		puts("0");
		return 0;
	}
	printf("%d\n",ans);
	rep(i,1,ans,1)
		printf("%d\n",res[i]);
	return 0;
}