Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define LL long long
- #define N ((int)6e4 + 5)
- #define MOD ((int)998244353 + 0)
- #define MAX ((int)1e9 + 7)
- #define MAXL ((ll)1e18 + 7)
- #define MAXP ((int)1e3 + 7)
- #define thr 1e-8
- #define pi acos(-1) /// pi = acos ( -1 )
- #define fastio ios_base::sync_with_stdio(false),cin.tie(NULL)
- #define endl "\n"
- using namespace std;
- int fac[N] , ifac[N];
- void PreProcess(int n)
- {
- fac[0] = 1;
- for(int i = 1 ; i <= n ; i++) fac[i] = 1LL*fac[i-1]*i % MOD;
- ifac[n] = BigMod(fac[n] , MOD-2);
- for(int i = n - 1 ; i >= 0 ; i--) ifac[i] = 1LL*ifac[i+1]*(i+1) % MOD;
- }
- int main()
- {
- PreProcess(1e7);
- fastio;
- int t;
- cin>>t;
- while(t--){
- int n , m , ans;
- LL k;
- cin>>n>>m>>k;
- if(k > n) ans = 0;
- else{
- ans = 1LL*fac[n] * ifac[k] % MOD * ifac[n - k] % MOD * BigMod(m , k) % MOD;
- }
- cout<<ans<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement