int main() {
    Matrix A(2, 2);
    A.mat[0][0] = 0;
    A.mat[0][1] = 1;
    A.mat[1][0] = 1;
    A.mat[1][1] = 1;
    long long a, b, mod;
    int T, t = 1, n;
    scanf("%d", &T);
    while(T--) {
        scanf("%lld %lld %d %lld", &a, &b, &n, &mod);
        Matrix B(2, 1);
        B.mat[0][0] = a;
        B.mat[1][0] = b;
        MOD = (int) pow(10, mod);
        printf("Case %d: \n", t++);
        if(n == 0) {
            printf("%lld\n", a);
        } else if(n == 1) {
            printf("%lld\n", b);
        }else {
            Matrix C = B.multiply(F(A, n - 1));
            for(int i = 0; i < C.get_row(); i++) {
                for(int j = 0; j < C.get_column(); j++) {
                    cout << C.mat[i][j] << ' ';
                }
                puts("");
            }
        }
    }
    return 0;
}