/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "lgput.in" ;
const char OUT [ ] = "lgput.out" ;
const int MOD = 1999999973 ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( int a = b ; a >= c ; -- a )

using namespace std ;

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

inline int put ( int x , int y )
{
    int sol = 1 ;
    for ( ; y ; y >>= 1 )
    {
        if ( y & 1 ) sol = 1LL * sol * x % MOD ;
        x = 1LL * x * x % MOD ;
    }
    return sol ;
}


int main()
{
    int n , m ;
    cin >> n >> m ;

    cout << put ( n , m ) ;


    return 0;
}