#include <bits/stdc++.h>
#include <atcoder/all>

namespace neguse {}
using namespace std;
using namespace atcoder;
using namespace neguse;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, n - 1, -1)
#define rrepi(i, a, b) for (int i = int(a); i > int(b); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep)(__VA_ARGS__)
#define _each1(i, v) for (auto &i : v)
#define _each2(i, j, v) for (auto &[i, j] : v)
#define each(...) _overload3(__VA_ARGS__, _each2, _each1, )(__VA_ARGS__)

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SUM(x) accumulate(all(x), 0LL)
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define ACC(x, acc) partial_sum(all(x), acc.begin()+1)
#define SORT(x) sort(all(x))
#define RSORT(x) sort(rall(x))
#define REVERSE(x) reverse(all(x))

#define dump(x) cerr << #x << " = " << (x) << '\n'
#define print(x) cout << (x) << '\n'
#define yes(f) cout << ((f) ? "Yes" : "No") << '\n'

#define ge(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define gt(v, x) (int)(upper_bound(all(v), x) - v.begin())
#define le(v, x) (int)(upper_bound(all(v), x) - v.begin()) - 1
#define lt(v, x) (int)(lower_bound(all(v), x) - v.begin()) - 1

template <class T> bool chmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> bool chmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }

ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { int64_t t; is >> t; a = t; return is; }
istream &operator>>(istream &is, modint1000000007 &a) { int64_t t; is >> t; a = t; return is; }

template <class S, class T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }
template <class T> istream &operator>>(istream &is, vector<T> &v) { for (T &x : v) is >> x; return is; }
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &x : v) os << x << ' '; return os; }
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { for (const vector<T> &x : v) os << x << '\n'; return os; }


int main() {
    ll K, N;
    cin >> K >> N;

    using mint = modint998244353;
    vector<mint> cnt(N+1);
    cnt[1] = (K == 1) ? 2 : 3;
    rep(i, 2, N+1) cnt[i] = cnt[i-1] + mint(2).pow(i-1);
    rep(i, 1, N+1) for (int j = 2*i; j <= N; j += i) cnt[j] -= cnt[i];
    cout << cnt[N] << endl;
    return 0;
}