#include <bits/stdc++.h>

#define MOD 666013

using namespace std;

long long fact[100010];
long long N, M;

long double power(double value, double expon)
{
    long double x = 1;
    for(int i = 1; i <= expon; i ++)
    {
        x *= value;
    }

    return x;
}
int main()
{
    cin >> N >> M;
    fact[0] = 1;
    for(int i = 1; i <= 100001; i ++)
    {
        fact[i] = (fact[i - 1] * i) % MOD;
    }
    long long M2 = min(M, 15LL);
    long double solution = 0, solution2 = 0;
    for(int i = 1; i <= M2; i ++)
    {
        solution += power(-1.0, i) / fact[i]; // Taylor Series
    }
    long long N2 = min(N, 15LL);
    for(int i = 1; i <= N2; i ++)
    {
        solution2 += power(-1.0, i) / fact[i]; // Taylor Series
    }
    //solution2 = 1 - fabs(solution2);

    long long S = (fact[M]*fabs(solution));
    long long S2 = (fact[N]*(fabs(solution2)));
    solution = 0;
    for(int i = 1; i <= S; i ++)
    {
        solution += fact[i];
    }
    cout << (S * S2 - min(S,S2))%MOD;
    //cout << ((long long)(fact[M]*fabs(solution)) * fact[N]) % MOD;
    return 0;
}