#include "hall.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int MAX_N = 19;
constexpr int MAX_V = 92378;

int N, K;

int to[1 << MAX_N], fr[1 << MAX_N];
int tof, used[1 << MAX_N], lev[1 << MAX_N], que[MAX_V], *qb, *qe;
int augment(int u) {
  used[u] = tof;
  for (int e = 0; e < N; ++e) if (u & 1 << e) {
    const int v = u - (1 << e);
    const int w = fr[v];
    if (!~w || (used[w] != tof && lev[u] < lev[w] && augment(w))) {
      to[u] = v; fr[v] = u; return 1;
    }
  }
  return 0;
}
int run() {
  memset(to, ~0, sizeof(to));
  memset(fr, ~0, sizeof(fr));
  memset(used, ~0, sizeof(used));
  for (tof = 0; ; ) {
    qb = qe = que; memset(lev, ~0, sizeof(lev));
    for (int u = 0; u < 1 << N; ++u) if (__builtin_popcount(u) == K) {
      if (!~to[u]) lev[*qe++ = u] = 0;
    }
    for (; qb != qe; ) {
      const int u = *qb++;
      for (int e = 0; e < N; ++e) if (u & 1 << e) {
        const int w = fr[u - (1 << e)];
        if (~w && !~lev[w]) lev[*qe++ = w] = lev[u] + 1;
      }
    }
    int f = 0;
    for (int u = 0; u < 1 << N; ++u) if (__builtin_popcount(u) == K) {
      if (!~to[u]) f += augment(u);
    }
    if (!f) return tof;
    tof += f;
  }
}


int solve(int N_, int K_, int S) {
  if (!tof) {
    N = N_;
    K = K_;
    run();
cerr<<"tof = "<<tof<<endl;
  }
  return to[S];
}