#include <stdio.h>
#define mod 1999999973

int bin[10000], l;
void binar(int p)
{
    l = 0;
    while(p != 0)
    {
        bin[l++] = p % 2;
        p = p / 2;
    }
}

int putere2(int n, int p)
{
    int x1 = n, x2 = n * n;
    int i;
    for(i = 0; i < l-1; i++)
        if(bin[i] == 0)
        {
            x2 = x1 * x2;
            x1 = x1 * x1;
        }
        else
        {
            x1 = x1 * x2;
            x2 = x2 * x2;
        }
    return x1;
}

int putere(long int x, long int n)
{
    if(n == 0)
        return 1;
    if(n % 2 == 1)
        return (x * putere(x, (n-1)/2) * putere(x, (n-1)/2))% mod;
    return (putere(x, n/2) * putere(x, n/2))% mod;
}

int putere3(int n, int p)
{
    int i;
    if(p == 0)
        return 0;
    if(p == 1)
        return n;
    int r = n;
    for(i = l-2; i >= 0; i--)
    {
        if(bin[i] == 1)
            r = (r * r  * n) % mod;
        else
            r = (r * r) % mod;
        //printf("%d. %d r = %d\n", l - i - 1, bin[i], r);
    }
    return r;
}

int main()
{
    freopen("lgput.in", "r", stdin);
    freopen("lgput.out", "w", stdout);

    int i, n, p;

    scanf("%d %d", &n, &p);

    binar(p);
    printf("%d", putere3(n, p)% mod);


    binar(p);

    return 0;
}