#include <stdio.h>
#include <string.h>
#include <iostream>
#include <bitset>
using namespace std;
const int n_max = 10001; // Definim numarul maxim de cifre al numerelor
const int m = 1999999973;

int main()
{
    unsigned int i, n, p;
    long long a, sol = 1;
    scanf("%d %d", &n, &p);
    a = n;
    cout<<bitset<8>(p)<<endl;
    for (i = 0; (1<<i) <= p; ++ i)  // Luam toti biti lui p la rand
    {
        cout <<"i "<<bitset<8>((1<<i))<< " (1<<i & p) "<< bitset<8>((1<<i) & p)<<endl;
        if ( ((1<<i) & p) > 0) // Daca bitul i din p este 1 atunci adaugam n^(2^i) la solutie
        {
            sol = (sol * a) % m;
            cout <<"sol "<< bitset<8>(sol)<<" "<<sol<< endl; // Assuming an 8-bit representation
        }
        a=(a * a) % m; // Inmultim a cu a ca sa obtinem n^(2^(i+1))

    }
    printf("%lld\n", sol); // Afisam solutia
}