/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<18;
const int COMBINATION_SIZE = 1<<21;
long long mypow(long long x, long long y, long long mod = MOD){
    long long res=1;
    while(y){
        if(y&1) {
            res = res * x % mod;
        }
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
struct Combination {
    long long fac[COMBINATION_SIZE], inv[COMBINATION_SIZE];
    bool built = 0;
    void build(){
        assert(MOD >= COMBINATION_SIZE);
        fac[0] = 1;
        for(int i = 1; i < COMBINATION_SIZE; i++) {
            fac[i] = fac[i - 1] * i % MOD;
        }
        inv[COMBINATION_SIZE - 1] = mypow(fac[COMBINATION_SIZE - 1], MOD - 2);
        for(int i = COMBINATION_SIZE - 2; i >= 0; i--) {
            inv[i] = inv[i + 1] * (i + 1) % MOD;
        }
    }
    long long C(int x, int y){
        if(y < 0 || y > x) {
            return 0;
        }
        if(!built) {
            built = 1;
            build();
        }
        return fac[x] * inv[y] % MOD * inv[x-y] % MOD;
    }
} comb;
int N, M;
LL dp[SIZE][19];
LL s[19];
void solve() {
    FOR(i,1,M){
        dp[i][1]=1;
        for(int j = 1; j <= 18; j++){
            if(!dp[i][j]) { break; }
            ADD(s[j],dp[i][j]);
            for(int k = i + i; k <= M; k += i) {
                ADD(dp[k][j + 1], dp[i][j]);
            }
        }
    }
    LL an=0;
    FOR(i,1,18){
        if(N>=i){
            ADD(an,comb.C(N-1,i-1)*s[i]);
        }
    }
    W(an);
}
void input() {
    R(N,M);
}
int main(){
    MOD=998244353;
    input();
    solve();
    return 0;
}

#include <bits/stdc++.h>
#define i64 long long
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;

const int M = 998244353;

struct mint {
	int x;

	mint(int x) : x(x) {}

	friend mint operator + (const mint &a, const mint b) {
		const int x = a.x + b.x;
		return mint(x >= M ? x - M : x);
	}
	
	friend mint operator - (const mint &a, const mint b) {
		const int x = a.x - b.x;
		return mint(x < 0 ? x + M : x);
	}
	
	friend mint operator * (const mint &a, const mint b) {
		return mint(1ll * a.x * b.x % M);
	}
};

int Pw(int a, int x = M - 2, int res = 1) {
	for (; x; x >>= 1, a = (mint(a) * a).x) {
		if (x & 1) {
			res = (mint(res) * a).x;
		}
	}
	return res;
}

const int N = 2e5 + 1, Nk = 20;
int n, nw, f[Nk][N], g[N], tmp[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> nw;
	rep(i, 1, nw + 1) {
		f[0][i] = 1;
	}
	rep(k, 0, Nk - 1) {
		rep(i, 1, nw + 1) {
			rep(j, 1, nw / i + 1) {
				int &F = f[k + 1][i * j];
				F = (F + mint(f[k][i]) * f[k][j]).x;
			}
		}
	}
	g[1] = 1;
	rep(k, 0, Nk - 1) {
		if (n >> k & 1) {
			rep(i, 1, nw + 1) {
				rep(j, 1, nw / i + 1) {
					int &F = tmp[i * j];
					F = (F + mint(g[i]) * f[k][j]).x;
				}
			}
			rep(i, 1, nw + 1) {
				g[i] = tmp[i], tmp[i] = 0;
			}
		}
	}
	int res = 0;
	rep(i, 1, nw + 1) {
		res = (res + mint(g[i])).x;
	}
	cout << res << '\n';
	return 0; 
} 