import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


/*
  -2: all 0
  -1: all 1
*/
int[] solve(int N, int K) {
  auto dp = new int[N + 1];
  auto kss = new int[][N + 1];
  foreach (n; 0 .. N + 1) {
    if (kss[n].length == 0) {
      dp[n] = -2;
      foreach (k; 1 .. K + 1) {
        if (n + k <= N) {
          kss[n + k] ~= k;
        }
      }
    } else if (kss[n].length == 1) {
      const k = kss[n][0];
      dp[n] = k;
      if (n + k <= N) {
        kss[n + k] ~= k;
      }
    } else {
      dp[n] = -1;
    }
  }
  return dp;
}

void main() {
  debug {{
    enum lim = 20;
    foreach (k; 1 .. 10 + 1) {
      writeln("k = ", k);
      auto dp = new bool[][](lim + 1, k + 1);
      foreach (n; 0 .. lim + 1) {
        foreach (a; 0 .. k + 1) {
          foreach (b; 1 .. k + 1) if (a != b) {
            if (n - b >= 0 && !dp[n - b][b]) {
              dp[n][a] = true;
            }
          }
        }
      }
      foreach (n; 0 .. lim + 1) {
        writef("%2d: ", n);
        foreach (a; 0 .. k + 1) {
          write(dp[n][a] ? 1 : 0);
        }
        writeln;
      }
      const res = solve(lim, k);
      foreach (n; 0 .. lim + 1) {
        foreach (a; 0 .. k + 1) {
          assert(dp[n][a] == !(res[n] == -2 || res[n] == a));
        }
      }
    }
  }}
  
  try {
    for (; ; ) {
      const N = readInt() - 1;
      const K = readInt();
      
      const res = solve(N, K);
      debug {
        writeln(res);
      }
      bool win;
      foreach (k; 1 .. K + 1) {
        if (res[N - k] == -2 || res[N - k] == k) {
          win = true;
          writeln(k);
        }
      }
      if (!win) {
        writeln(0);
      }
    }
  } catch (EOFException e) {
  }
}