#include <iostream>
#include <cmath>

using namespace std;
int64_t **matrix(int64_t **a, int64_t **b,int n)
{
    int64_t **c = new int64_t*[n];
    for(int i=0;i<n;i++)
    {
        c[i] = new int64_t[n];
    }
    for(int i=0; i < n; i++){
        for(int j=0; j < n; j++){
            c[i][j]=0;
            for(int k=0; k < n; k++)
            {
                c[i][j]+=a[i][k]*b[k][j];
            }
        }
    }
    return c;

}

int64_t  **binpow (int64_t **a, int k,int n) {
    if (k == 0)
    {
        int64_t **answer = new int64_t*[n];
        for(int i=0;i<n;i++)
        {
            answer[i] = new int64_t[n];
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(i==j) answer[i][j]=1;
                else answer[i][j] = 0;
            }
        }
        return answer;
    }
    if (k % 2 == 1)
    {
        return matrix(binpow(a, k-1,n), a,n);
    }
    else {
        int64_t **b = binpow (a, k/2,n);
        return matrix(b,b,n);
    }
}





int main()
{
    int n, m, k;
    int startx, endx;
    cin >> n >> m >> k;
    int *pole = new int [n*m];
    for(int j=0;j<n*m;j++)
    {
        char x;
        cin >> x;
        if(x == '+') pole[j] = -1;
        else if(x == '.') pole[j] = 1;
        else if(x == '#'){startx = j; pole[j] = 1;}
        else if(x == '@'){endx = j; pole[j] = 1;}
    }
    int64_t **kek = new int64_t *[n*m];
    for(int i=0;i<n*m;i++)
    {
        kek[i] = new int64_t [m*n];
    }
    for(int i=0;i<n*m;i++)
    {
        for(int j=i;j<n*m;j++)
        {
            if(((abs(i-j) == 1 && (((j+1) % m )!= 0) && (((i+1) % m )!=0)) ||((i-j) == 1 && (((i+1) % m)==0)) ||((j-i==1) && (((j+1) % m)==0)) ||((abs(i-j)==m))) && pole[i] == 1 && pole[j] == 1 )
            {
                kek[i][j] = 1;
                kek[j][i] = 1;
            }
            else{
                kek[i][j] = 0;
                kek[j][i] = 0;
            }
        }
    }
    /*for(int i=0;i<n*m;i++)
    {
        for(int j=0;j<n*m;j++){
            cout << kek[i][j] << " ";
        }
        cout << endl;
    } */
    int64_t **answer  = binpow(kek,k,n*m);
    cout << answer[startx][endx] << " ";


    return 0;
}