#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF32 2147483647
#define ALL(x) x.begin(), x.end()
vector<int> ddx = {0, 1, 0, -1, 1, 1, -1, -1};
vector<int> ddy = {1, 0, -1, 0, 1, -1, -1, 1};

ll pow(ll a,ll n,ll mod){
  ll ret = 1;
  while(n > 0) {
    if(n & 1) ret = ret * a % mod;
    a = a * a % mod;  
    n >>= 1;
  }
  return ret;
}
int main() {
  ll a,n;cin>>a>>n;
  ll mod = 1000000007;
  cout<< mod <<endl;
  cout<< pow(a,n,mod) <<endl;
  return 0;
}