1
#include <cstdio>
2
#include <cstring>
3
#include <cmath>
4
#include <algorithm>
5
using namespace std;
6
const long long MOD = 998244353;
7
long long phi(long long x)
8
{
9
    double ans = x;
10
    int i = 2;
11
    int Sqrt = ceil(sqrt(x));
12
    while (x != 1)
13
    {
14
        if (i > Sqrt)
15
        {
16
            ans *= (1 - (double)1 / x);
17
            break;
18
        }
19
        if (x % i == 0)
20
        {
21
            ans *= (1 - (double)1 / i);
22
            while (x % i == 0)
23
                x /= i;
24
        }
25
        i++;
26
    }
27
    return (long long)ans;
28
}
29
int main()
30
{
31
    long long a,b;
32
    scanf("%lld%lld",&a,&b);
33
    printf("%lld",((((a%MOD)*(b%MOD)%MOD)*(phi(a)%MOD)%MOD)*(phi(b)%MOD))%MOD);
34
    //while(1);
35
}