思路：

 

AC代码：

#include "iostream"#include "string.h"#include "stack"#include "queue"#include "string"#include "vector"#include "set"#include "map"#include "algorithm"#include "stdio.h"#include "math.h"#pragma comment(linker, "/STACK:102400000,102400000")#define ll long long#define endl ("\n")#define bug(x) cout<
     
      <<" "<<"UUUUU"<
      
       0){        if(b&1){            ans*=a;            ans%=mod;        }        a*=a;        a%=mod;        b>>=1;    }    return ans;}int main(){    ll n,m;    int T=0;    while(cin>>n>>m){        cout<<"Case #"<<++T<<": "<<(pow(n,m)+mod)%mod<