L - Fantasy of a Summation(快速幂)

If you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen once. Here is the code I saw in my dream.

#include <stdio.h>

int cases, caseno;
int n, K, MOD;
int A[1001];

int main() {
    scanf("%d", &cases);
    while( cases-- ) {
        scanf("%d %d %d", &n, &K, &MOD);

        int i, i1, i2, i3, ... , iK;

        for( i = 0; i < n; i++ ) scanf("%d", &A[i]);

        int res = 0;
        for( i1 = 0; i1 < n; i1++ ) {
            for( i2 = 0; i2 < n; i2++ ) {
                for( i3 = 0; i3 < n; i3++ ) {
                    ...
                    for( iK = 0; iK < n; iK++ ) {
                        res = ( res + A[i1] + A[i2] + ... + A[iK] ) % MOD;
                    }
                    ...
                }
            }
        }
        printf("Case %d: %d\n", ++caseno, res);
    }
    return 0;
}

Actually the code was about: 'You are given three integers n, K, MOD and n integers: A0, A1, A2 ... An-1, you have to write K nested loops and calculate the summation of all Ai where i is the value of any nested loop variable.'

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with three integers: n (1 ≤ n ≤ 1000), K (1 ≤ K < 231), MOD (1 ≤ MOD ≤ 35000). The next line contains n non-negative integers denoting A0, A1, A2 ... An-1. Each of these integers will be fit into a 32 bit signed integer.

Output

For each case, print the case number and result of the code.

Sample Input

2

3 1 35000

1 2 3

2 3 35000

1 2

Sample Output

Case 1: 6

Case 2: 36

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
long long int Pow(long long int a, long long int b, long long int c)
{
   if(a==0)
   return 0;
   long long int r = 1, base = a;
   while(b)
   {
     if(b&1)
     {
       r = (r * base) % c;
     }
     base = (base * base) % c;
     b>>=1;
   }
   return r;
}
int main()
{
  int T;
  scanf("%d", &T);
  long long int a, b, c;
  for(int t=1;t<=T;t++)
  {
    scanf("%lld %lld %lld", &a, &b, &c);
    long long int sum = 0, m;
    for(int i=1;i<=a;i++)
    {
      scanf("%lld", &m);
      sum += m;
    }
    printf("Case %d: %lld\n", t, ((Pow(a, b-1, c)*sum)%c*b)%c);
  }
  return 0;
}