#include <cstdio>

#include <iostream>

#include <cstring>

#include <string>

#include <queue>

#include <stack>

#include <set>

#include <map>

#include <cmath>

#include <algorithm>

#define mid ((l + r) / 2)

using namespace std;

typedef pair<int, int> pii;

typedef long long ll;

typedef unsigned long long ull;

const double pi = acos(-1.0);

const int maxn = 1e3 + ;

int n, m, k, step, ans, Dist;

char G[maxn][maxn];

int dist[maxn][maxn];

bool vis[maxn][maxn];

pii B, E, now, Next;

int bfs(int x, int y) {

    memset(vis, false, sizeof vis);

    memset(dist, , sizeof dist);

    queue <pii> Q;

    Q.push(make_pair(x, y));

    dist[x][y] = ;

    while(!Q.empty()) {

        pii now = Q.front();

        Q.pop();

        if(now.first == E.first && now.second == E.second) return dist[now.first][now.second];

        for(int dx = -; dx <= ; dx ++) {

            for(int dy = -; dy <= ; dy ++) {

                if(abs(dx - dy) == ) {

                    Next.first = now.first + dx;

                    Next.second = now.second + dy;

                    if(!vis[Next.first][Next.second] && Next.first >=  && Next.first < n && Next.second >=  && Next.second < m && G[Next.first][Next.second] != '#') {

                        dist[Next.first][Next.second] = dist[now.first][now.second] + ;

                        Q.push(make_pair(Next.first, Next.second));

                        vis[Next.first][Next.second] = true;

                    }

                }

            }

        }

    }

    return -;

}

void dfs(pii B, pii E, int D) {

    if(B.first == E.first && B.second == E.second) {

        if(D < Dist) {

            step = ;

            Dist = D;

        } else if(D == Dist) step ++;

        return;

    }

    if(D > Dist) return;

    for(int i = -; i <= ; i ++) {

        for(int j = -; j <= ; j ++) {

            if(abs(i - j) == ) {

                if(B.first + i >=  && B.first + i < n && B.second + j >=  && B.second + j < m) {

                    if(G[B.first + i][B.second + j] != '#' && !vis[B.first + i][B.second + j]) {

                        vis[B.first + i][B.second + j] = true;

                        dfs(make_pair(B.first + i, B.second + j), E, D + );

                        vis[B.first + i][B.second + j] = false;

                    }

                }

            }

        }

    }

}

int main() {

    ios_base :: sync_with_stdio(false);

    int t, Case = ;

    cin >> t;

    while(t --) {

        step = ;

        Dist = 0x3f3f3f3f;

        cin >> n >> m >> k;

        for(int i = ; i < n; i ++) cin >> G[i];

        for(int i = ; i < n; i ++) {

            for(int j = ; j < m; j ++) {

                if(G[i][j] == 'L') B = make_pair(i, j);

                if(G[i][j] == 'C') E = make_pair(i, j);

            }

        }

        ans = bfs(B.first, B.second);

        if(ans > k) ans = -;

        cout << "Case #" << ++ Case << ": " << ans << ' ';

        if(ans != -) {

            memset(vis, false, sizeof vis);

            dfs(B, E, );

            cout << step;

        }

        cout << endl;

    }

    return ;

}