#include <bits/stdc++.h>

int ask(int, int);
int solve(int, int);

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

int n, k;

int qry(int l, int r) {
  int len = l <= r ? r - l + 1 : n - l + r + 1, res = ask(l, r);
  return res - len + res;
}

int solve(int _n, int _k) {
  n = _n, k = _k;
  if (k & 1) k--;
  if (k == 0 || k == n) return 0;
  int cur = qry(n - k, n - 1);
  if (!cur) return n - k;
  vector<int> vis(n, 0);
  if (cur > 0) {
    vector<int> vec;
    int x = 0;
    while (!vis[x]) vec.emplace_back(x), vis[x] = 1, x = (x + k) % n;
    vec.pop_back();
    int l = 0, r = SZ(vec) - 1, res = SZ(vec);
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (qry(0, (vec[mid] + k - 1) % n) < 0) res = mid, r = mid - 1;
      else l = mid + 1;
    }
    int pos = vec[res];
    vec.clear();
    x = n - k;
    while (x != pos) vec.emplace_back(x), x = (x + 1) % n;
    l = 0, r = SZ(vec) - 1;
    while (l <= r) {
      int mid = (l + r) >> 1, cur = qry(vec[mid], (vec[mid] + k - 1) % n);
      if (cur == 0) return vec[mid];
      else if (cur < 0) r = mid - 1;
      else l = mid + 1;
    }
  } else {
    vector<int> vec;
    int x = 0;
    while (!vis[x]) vec.emplace_back(x), vis[x] = 1, x = (x + k) % n;
    vec.pop_back();
    int l = 0, r = SZ(vec) - 1, res = SZ(vec);
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (qry(0, (vec[mid] + k - 1) % n) > 0) res = mid, r = mid - 1;
      else l = mid + 1;
    }
    int pos = vec[res];
    vec.clear();
    x = n - k;
    while (x != pos) vec.emplace_back(x), x = (x + 1) % n;
    l = 0, r = SZ(vec) - 1;
    while (l <= r) {
      int mid = (l + r) >> 1, cur = qry(vec[mid], (vec[mid] + k - 1) % n);
      if (cur == 0) return vec[mid];
      else if (cur > 0) r = mid - 1;
      else l = mid + 1;
    }
  }
}