#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, K;
  cin >> N >> K;

  vector<ll> dp(N, 0);
  dp.at(N - 1) = 0;
  for (ll i = N - 1; i > 1; i--)
  {
    if (dp.at(i) == 0)
    {
      for (ll j = 1; j <= K; j++)
      {
        ll ni = i - j;
        if (ni < 0)
          break;
        if (dp.at(ni) == 0 || dp.at(ni) == j)
          dp.at(ni) = j;
        else
          dp.at(ni) = K + 1;
      }
    }
    else if (dp.at(i) != K + 1)
    {
      ll j = dp.at(i);
      ll ni = i - j;
      if (ni >= 0)
      {
        if (dp.at(ni) == 0 || dp.at(ni) == j)
          dp.at(ni) = j;
        else
          dp.at(ni) = K + 1;
      }
    }
  }

  /*
  for (ll i = 0; i < N; i++)
  {
    cerr << dp.at(i) << endl;
  }
  //*/

  vector<ll> ans;
  for (ll i = 1; i <= K; i++)
  {
    if (dp.at(i) == 0 || dp.at(i) == i)
      ans.push_back(i);
  }
  if (ans.size() == 0)
    cout << 0 << endl;
  else
  {
    for (auto ans0 : ans)
    {
      cout << ans0 << '\n';
    }
  }
}