快速幂板子

x位底数，k为指数

const int mod = 1e9 + 7;
long long ksm(int x, int k) {
	int sum = 1;
	for (;k;k>>=1, x = x * x % mod) if (k & 1) sum = sum * x % mod;
	return sum;
}

const int mod = 1e9 + 7;
long long ksm(int x, int k) {
    long long sum = 1;
    while (k) {
        if(k & 1) ans = ans * x % mod;
		x = x * x % mod;
        k >>= 1;
    }
    return sum;
}