#include <bits/stdc++.h>
using namespace std;
long long n, K, now, sum, ans;
const long long N = 2000, p = 174086401;
long long f[N + 5], s[N + 5];
signed main() {
  if (fopen("fairy.in", "r")) {
    freopen("fairy.in", "r", stdin);
    freopen("fairy.out", "w", stdout);
  }
  scanf("%lld%lld", &n, &K);
  K--;
  for (long long i = 1; i <= min(K, n); ++i) {
    f[0] = 1;
    sum = 0;
    for (long long j = 1; j <= i; ++j) {
      f[j] = (f[j - 1] * 2) % p;
      sum = (sum + f[j]) % p;
    }
    for (long long j = i + 1; j <= n; ++j) {
      f[j] = sum;
      sum = ((sum - f[j - i]) % p + p) % p;
      sum = (sum + f[j]) % p;
    }
    s[i] = ((f[n] - now) % p + p) % p;
    now = f[n];
  }
  for (long long i = 1; i <= min(K, n); ++i) {
    long long limit = min(K / i, n);
    f[1] = s[i];
    sum = s[i];
    for (long long j = 2; j <= limit; ++j) {
      f[j] = (f[j - 1] * 2) % p;
      sum = (sum + f[j]) % p;
    }
    for (long long j = limit + 1; j <= n; ++j) {
      f[j] = sum;
      sum = ((sum - f[j - limit]) % p + p) % p;
      sum = (sum + f[j]) % p;
    }
    ans = (ans + f[n]) % p;
  }
  printf("%lld\n", ans);
  return 0;
}
