#include<bits/stdc++.h>
#define MOD 1999999973
using namespace std;
class InParser {
    vector<char> str;
    int ptr;
    ifstream fin;

    char getChar() {
        if (ptr == int(str.size())) {
            fin.read(str.data(), str.size());
            ptr = 0;
        }
        return str[ptr++];
    }

    template<class T>
    T getInt() {
        char chr = getChar();
        while (!isdigit(chr) && chr != '-')
            chr = getChar();
        int sgn = +1;
        if (chr == '-') {
            sgn = -1;
            chr = getChar();
        }
        T num = 0;
        while (isdigit(chr)) {
            num = num * 10 + chr - '0';
            chr = getChar();
        }
        return sgn * num;
    }

public:
    InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
    ~InParser() { fin.close(); }

    template<class T>
    friend InParser& operator>>(InParser& in, T& num) {
        num = in.getInt<T>();
        return in;
    }
};
int n, p;
InParser fin("lgput.in");
ofstream fout("lgput.out");
int main()
{
    fin >> n >> p;
    unsigned long long a = 1;
    while(p > 0)
    {
        if(p & 1)
        {
            a = ((a % MOD) * n) % MOD;
        }
        p = p / 2;
        n = (n * n) % MOD;
    }
    fout << (a % MOD);
    return 0;
}