#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const ll mod = 998244353;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

template<class T, T mod>
struct modint {
    T num;
    constexpr modint(T a = 0) : num((a % mod + mod) % mod) {}

    constexpr modint operator+ (const modint& rhs) const noexcept {
        return modint(*this) += rhs;
    }
    constexpr modint operator- (const modint& rhs) const noexcept {
        return modint(*this) -= rhs;
    }
    constexpr modint operator* (const modint& rhs) const noexcept {
        return modint(*this) *= rhs;
    }
    constexpr modint operator/ (const modint& rhs) const noexcept {
        return modint(*this) /= rhs;
    }

    constexpr modint& operator += (const modint& rhs) noexcept {
        num = (num + rhs.num) % mod;
        return *this;
    }
    constexpr modint& operator -= (const modint& rhs) noexcept {
        num = (num - rhs.num + mod) % mod;
        return *this;
    }
    constexpr modint& operator *= (const modint& rhs) noexcept {
        num = num * rhs.num % mod;
        return *this;
    }
    constexpr modint& operator /= (modint rhs) noexcept {
        assert(rhs.num != 0);
        T y = mod - 2;
        while (y > 0) {
            if (y & 1) *this *= rhs;
            rhs *= rhs;
            y /= 2;
        }
        return *this;
    }

    constexpr modint& operator++ () noexcept {
        *this += (modint)1;
        return *this;
    }
    constexpr modint& operator++ (int) noexcept {
        modint tmp = *this;
        ++*this;
        return tmp;
    }
    constexpr modint& operator-- () noexcept {
        *this -= (modint)1;
        return *this;
    }
    constexpr modint& operator-- (int) noexcept {
        modint tmp = *this;
        --*this;
        return tmp;
    }

    friend ostream &operator << (ostream& lhs, const modint& rhs) {
        lhs << rhs.num;
        return lhs;
    }
    
    friend istream &operator >> (istream& lhs, modint& rhs) {
        lhs >> rhs.num;
        rhs.num = (rhs.num % mod + mod) % mod;
        return lhs;
    }
};

using mint = modint<ll, mod>;

mint modpow(mint x, ll y) {
    if (y == 0) return 1;
    return modpow(x * x, y / 2) * (y & 1 ? x : 1);
}

// 見ている桁, 最小でどの桁から使う, 0: < or = 1: >
mint dp[70][70][2];
// cnt[i][j] := 1 << iまでを使って1 << jを作る方法
mint cnt[70][70];

int n;
ll c;
int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cin >> n >> c;
    c -= 1ll << (n - 1);
    if (c < 0) {
        cout << 0 << '\n';
        return 0;
    }

    rep (i, 60) rep (j, 60) {
        if (i > j) continue;
        else if (i == j) cnt[i][j] = 1;
        else {
            cnt[i][j] += cnt[i][j - 1];
            rep (x, min(i, j - 1)) {
                ll pre = 0;
                cnt[i][j] += cnt[x][j - 1] * cnt[i - x][j - x - 1];
            } 
        }
    }

    dp[0][0][0] = 1;
    rep (i, 60) rep (j, n) rep (x, 2) {
        int nc = c >> i & 1;
        rep (y, 2) {
            int nxt = y * 2 + x > nc * 2;
            if (y == 0) dp[i + 1][j][nxt] += dp[i][j][x];
            else {
                rep (z, j, min(n,i + 1)) {
                    dp[i + 1][z][nxt] += dp[i][j][x] * cnt[z - j][i - j];
                }
            }
        }
    }

    mint ans = 0;
    rep (j, 60) ans += dp[60][j][0];
    cout << ans << '\n';
}