#include <fstream>
#include <iostream>
#include <queue>

using namespace std;
const int mod=1999999973;

int main(){
    ifstream fin("lgput.in");
    ofstream fout("lgput.out");
    long long n, p;
    int ans, b;
    fin>>n>>p;
    ans=1;
    while(p){
        if(p&1)
            ans=((long long)ans*n)%mod;
        n=((long long)n*n)%mod;
        p>>=1;
        cout<<p<<" ";
    }
    fout<<ans;
    return 0;
}