#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)

const ll mod = 1000000007LL;

ll modpow(ll a, ll n){
	if(n == 1LL) return a%mod;
	else if(n % 2 == 1) return (a*modpow(a, n-1))%mod;
	else return (modpow(a, n/2)*modpow(a, n/2))%mod;
}

int main(){
	ll a, n;
	cin >> a >> n;
	cout << mod << endl;
	cout << modpow(a, n) << endl;
	return 0;
}