#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,K;

int winq[525252];
vector<int> W[525252];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	
	cin>>N>>K;

	
	for(i=N-1;i>=0;i--) {
		if(W[i].empty()) {
			winq[i]=-2;
			for(j=1;j<=K;j++) if(i-j>=0) W[i-j].push_back(j);
		}
		else if(W[i].size()>=2) {
			winq[i]=-1;
		}
		else {
			x=winq[i]=W[i][0];
			if(i-x>=0) W[i-x].push_back(x);
		}
	}
	
	int num=0;
	for(i=1;i<=K;i++) {
		if(winq[i]==i||winq[i]==-2) {
			cout<<i<<endl;
			num++;
		}
	}
	if(num==0) cout<<0<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}