function modPow(a, n, m) {
    let r = BigInt(1);
    while (n > 0n) {
        if (n & 1n) r = r * a % m;
        a = a * a % m;
        n >>= 1n;
    }
    return r;
}
function Main(input) {
    let src = input.replace("\n", "").split(" ");
    const a = BigInt(src[0]);
    const n = BigInt(src[1]);
    const m = BigInt(998244353);
    console.log(Number(m));
    console.log(Number(modPow(a, n, m)));
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));