// Author: Klay Thompson
// Problem: K. K-pop Strings
// Memory Limit: 2048 MB
// Time Limit: 7000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#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>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

template <int P>
class mod_int {
  using Z = mod_int;

private:
  static int mo(int x) { return x < 0 ? x + P : x; }

public:
  int x;
  int val() const { return x; }
  mod_int() : x(0) {}
  template <class T>
  mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
  bool operator==(const Z &rhs) const { return x == rhs.x; }
  bool operator!=(const Z &rhs) const { return x != rhs.x; }
  Z operator-() const { return Z(x ? P - x : 0); }
  Z pow(long long k) const {
    Z res = 1, t = *this;
    while (k) {
      if (k & 1) res *= t;
      if (k >>= 1) t *= t;
    }
    return res;
  }
  Z &operator++() {
    x < P - 1 ? ++x : x = 0;
    return *this;
  }
  Z &operator--() {
    x ? --x : x = P - 1;
    return *this;
  }
  Z operator++(int) {
    Z ret = x;
    x < P - 1 ? ++x : x = 0;
    return ret;
  }
  Z operator--(int) {
    Z ret = x;
    x ? --x : x = P - 1;
    return ret;
  }
  Z inv() const { return pow(P - 2); }
  Z &operator+=(const Z &rhs) {
    (x += rhs.x) >= P && (x -= P);
    return *this;
  }
  Z &operator-=(const Z &rhs) {
    (x -= rhs.x) < 0 && (x += P);
    return *this;
  }
  Z &operator*=(const Z &rhs) {
    x = 1ULL * x * rhs.x % P;
    return *this;
  }
  Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
  friend T operator o(const Z &lhs, const Z &rhs) {\
    Z res = lhs;                                   \
    return res o## = rhs;                          \
  }
  setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
const int P = 998244353;
using Z = mod_int<P>;

const int maxn = 110;

int n, k, fa[maxn], cnt;
vector<vector<pii>> vec;
Z ans;
mt19937 rnd(random_device{}());

int find(int x) {
  return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void dfs(int dep, Z coe) {
  if (dep == SZ(vec)) return ans += coe * Z(35).pow(cnt), void();
  int ok = 0;
  for (auto [x, y] : vec[dep]) ok |= (find(x) != find(y));
  if (!ok) return;
  dfs(dep + 1, coe);
  int cfa[maxn];
  rep (i, 1, n) cfa[i] = fa[i];
  int dlt = 0;
  for (auto [x, y] : vec[dep]) if (find(x) != find(y)) dlt++, fa[find(x)] = find(y);
  cnt -= dlt;
  dfs(dep + 1, P - coe);
  cnt += dlt;
  rep (i, 1, n) fa[i] = cfa[i];
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> k;
  rep (len, max(2, n - k), n) {
    if (len & 1) continue;
    rep (i, 1, n - len + 1) {
      vector<pii> cur;
      rep (j, 1, len / 2) cur.emplace_back(i + j - 1, i + len / 2 + j - 1);
      vec.emplace_back(cur);
    }
  }
  cerr << SZ(vec) << endl;
  // shuffle(ALL(vec), rnd);
  reverse(ALL(vec));
  rep (i, 1, n) fa[i] = i;
  cnt = n, dfs(0, 1);
  cout << ans.val() << '\n';
}