#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> > p;
int n, m, i;
int main()
{
    cin>>n>>m;
    int a[n+1]={};
  
    
    for(i = 2; i <= m; i++)
    {
        for(int p = i; p <= n; p=p+i)
        {
                a[p] = !a[p];
        }
    }
    for(i = 1; i <= n; i++)
    {
		if(!a[i]) p.push(i);
    }
    while(!p.empty())
    {
		cout<<p.top();
		p.pop();
		if(!p.empty()) cout<<",";
	}
    return 0;
}

优先队列！好用！