快速幂+快速乘模板

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
inline ll ksc(ll x, ll y, ll mod) {
	return (x * y - (ll)((long double)x / mod * y) * mod + mod) % mod;
}
inline ll ksm(ll x, ll y, ll mod) {
	ll ans = 1;
	while (y) {
		if (y) ans = ksc(ans, x, mod);
		x = ksc(x, x, mod);
		y >>= 1;
	}
	return ans;
}

int main() {


	return 0;
}