#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define N 1000010
using namespace std;

ll n, m, a[N], ans[N];

inline ll read(){
	ll s = 0, w = 1;
	char ch = getchar();
	for (; ch < '0' || ch > '9'; w *= ch == '-' ? -1 : 1, ch = getchar());
	for (; ch >= '0' && ch <= '9'; s = s * 10 + ch - '0' % mod, ch = getchar());
	return s * w;
}

bool chck(ll x){
	ll sum = 0;
	for (ll i = n; i >= 0; --i) sum = (sum + a[i]) * x % mod;
	sum = (sum + a[0]) % mod;
	return sum == 0;
}

int main(){
	n = read(), m = read();
	for (ll i = 0; i <= n; ++i) a[i] = read();
	for (ll i = 1; i <= m; ++i)
		if (chck(i)) ans[++ans[0]] = i;
	for (ll i = 0; i <= ans[0]; ++i) printf("%lld\n", ans[i]);
	return 0;
}