#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define N 21

int t,k,cas;
ll a,b,dp[N],ans;

int main()
{
    scanf("%d",&t);

    while(t--){
        scanf("%lld%lld%d",&a,&b,&k);
        printf("Case %d: ",++cas);
        if(k == 1) printf("%lld\n",a);
        else if(k == 2) printf("%lld\n",b);
        else{
            dp[1] = a;
            dp[2] = b;
            ans = b;
            for(int i = 3; i <= k; i++){
                dp[i] = dp[i-1] + dp[i-2];
                ans += dp[i];
            }

            printf("%lld\n",ans);
        }
    }

    return 0;
}