#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

vector<int> naive(int n, int k){
    auto win = vec2d(n, k+1, false);
    for(int rem = 1; rem < n; rem++){
        for(int pre = 0; pre <= k; pre++){
            bool ok = false;
            for(int cur = 1; cur <= k; cur++){
                if(cur == pre) continue;
                if(cur > rem) continue;
                if(!win[rem-cur][cur]) ok = true; 
            }
            win[rem][pre] = ok;
        }
        // cout << rem << ":";
        // for(int pre = 1; pre <= k; pre++) cout << win[rem][pre] << ' ';
        // cout << endl;
    }
    vector<int> ans;
    for(int cur = 1; cur <= k; cur++){
        if(!win[n-cur-1][cur]) ans.push_back(cur);
    }
    // for(int rem = 0; rem < n; rem++) cout << win[rem][rem%(k+1)] << ' ';
    // cout << endl;
    return ans;
}

vector<int> solve(int n, int k){
    if(k == 1) return {1};
  
    vector<bool> win(n);
    vector<vector<int>> v(k+1);
    vector<bool> all_lose(n);
    vector<int> lose_idx(n, -1);
    int prev_lose = 0;
    all_lose[0] = true;
    for(int x = 0; x <= k; x++) v[(x*2)%(k+1)].push_back(x);
    auto judge_win = [&](int rem, int pre){
        if(all_lose[rem]) return false;
        return pre != lose_idx[rem];
    };
    for(int rem = 1; rem < n; rem++){
        if(rem == prev_lose) {
            all_lose[rem] = true;
            continue;
        }
        if(prev_lose+k+1 == rem){
            if(k%2 == 0){
                // 負ける
                all_lose[rem] = true;
                prev_lose = rem;
                continue;
            }
            int x = (k+1)/2;
            if(win[rem]){
                lose_idx[rem] = x;
                if(rem+x < n) {
                    win[rem+x] = true;
                }
                prev_lose = rem+1;
            }else{
                all_lose[rem] = true;
                prev_lose = rem;
            }
        }
        int r = rem-prev_lose;
        if(win[rem]){

        }else{
            lose_idx[rem] = r;
            if(rem+r < n){
                win[rem+r] = true;
            }
        }     
    }
    
    vector<int> ans;
    for(int cur = 1; cur <= k; cur++){
        if(!judge_win(n-cur-1, cur)) ans.push_back(cur);
    }
    // print_vector(win);
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    // print_vector(naive(n, k));
    auto ans = solve(n, k);
    if(ans.empty()){
        cout << 0 << endl;
    }else{
        print_vector(ans, '\n');
    }
}