#include<cstdio>

 #include<vector>

 #include<cstring>

 using namespace std;

 int vis[ + ];

 int work_quality_factor(int n, int quality_fac[], int frequency[])

 {//n是待分解的数,quality_fac[]会存放它包含的质因子,而frequency[]存放对应次数

  //如q_f[k]=7,fre[k]=2就表示质因数分解后里面包含有7,且次数是2

  //函数返回有几种质因子,比如分解了25就返回1,分解28返回2

     int res, temp, i;

     res = ;

     temp = n;

     for (i = ; i*i <= temp; i++)

         if (temp%i == )

         {

             quality_fac[res] = i;

             frequency[res] = ;

             while (temp%i == )

             {

                 temp = temp / i;

                 frequency[res]++;

             }

             res++;

         }

     if (temp > )

     {

         quality_fac[res] = temp;

         frequency[res++] = ;

     }

     return res;

 }

 int main() {

     int n, m;

     while (scanf("%d%d", &n, &m) != EOF) {

         n--;

         memset(vis, , sizeof(vis));

         int fac[], frq[];

         int primenum = work_quality_factor(m, fac, frq);

         for (int i = ; i < primenum; i++) {

             int min_e = frq[i], x, e = ;

             // c(n,k)=c(n,k-1)*(n-k+1)/k

             for (int k = ; k < n; k++) {

                 //分成上下两部分除，上面的幂次的贡献为正，下面为负

                 x = n - k + ;

                 while (x%fac[i]==) { x /= fac[i]; e++; }

                 x = k;

                 while (x%fac[i]==) { x /= fac[i]; e--; }

                 if (e < min_e)vis[k] = ;

             }

         }

         vector<int>ans;

         for (int i = ; i < n; i++)

             if (!vis[i])ans.push_back(i + );

         printf("%d\n", ans.size());

         if (!ans.empty()) {

             printf("%d", ans[]);

             for (int i = ; i < ans.size(); i++)

                 printf(" %d", ans[i]);

         }

         printf("\n");

     }

     return ;

 }