#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <unordered_set>
#include <functional>
#include <stack>
#include <unordered_map>
#include <map>
#include <cstring>
using namespace std;

inline int read() {
    int x = 0, f = 1;
    char c = getchar();
    while (c > '9' || c < '0')
        f = c == '-' ? -1 : 1, c = getchar();
    while (c >= '0' && c <= '9')
        x = x * 10 + c - 48, c = getchar();
    return x * f;
}
using i64 = long long;
using u64 = unsigned long long;
using pii = pair<int, int>;
using pll = pair<i64, i64>;

const int mod = 998244353;

i64 qpow (i64 a, int b) {
    i64 x = 1;
    while (b) {
        if (b & 1) x = x * a % mod;
        a = a * a % mod, b >>= 1;
    }
    return x;
}

int main() {
    u64 n = read(), m = read();
    cout << (n - m + 1) * qpow(n + 1, m - 1) % mod;
    return 0;
}