#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
/*
using mint=modint998244353;
const ll mod=998244353;
const ld EPS=1e-8;
//*/
//*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
int main(){
  ll K,N;cin>>K>>N;
  vm T(7);
  T[0]=N;
  T[1]=T[2]=T[6]=N-1;
  T[3]=T[4]=max(0LL,N-2);
  T[5]=max(0LL,N-3);
  REP(i,K){
  	//cout<<T[0]<<endl;
  	vm _T(7);
  	_T[0]=N*T[1]*T[1]*T[1];
  	_T[1]=T[1]*(T[2]*T[2]+(N-1)*T[3]*T[3]);
  	_T[2]=T[2]*T[2]*T[6]+(N-1)*T[4]*T[3]*T[3];
  	_T[6]=T[6]*T[6]*T[6]+(N-1)*T[4]*T[4]*T[4];
  	if(N>=2){
  		_T[3]=T[2]*T[3]*T[4]*2+(N-2)*T[5]*T[3]*T[3];
  		_T[4]=T[6]*T[4]*T[4]+T[4]*T[4]*T[4]+(N-2)*T[4]*T[5]*T[5];
  	}
  	if(N>=3)_T[5]=T[4]*T[4]*T[5]*3+(N-3)*T[5]*T[5]*T[5];
  	T=_T;
  }
  cout<<T[0]<<endl;
  return 0;
}