#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=3005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

struct matrix{
	int a[2][2];
	void clear(){clr(a,0);}
}h,tmp;
inline matrix operator * (matrix a,matrix b){
	matrix tmp;
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++){
			tmp.a[i][j]=0;
			for(int k=0;k<2;k++)
				ch(tmp.a[i][j],(ll)a.a[i][k]*b.a[k][j]);
		}
	return tmp;
}
inline matrix exp(matrix x,ll y){
	matrix ans;ans.clear();ans.a[0][0]=ans.a[1][1]=1;
	while(y){
		if(y&1) ans=ans*x;
		x=x*x;y>>=1;
	}
	return ans;
}

int id,n,m,row,col;ll k;
bool a[N][N];
char str[N];

int main(){
#ifdef rqgao2014
	assert(freopen("input.txt","r",stdin));
#endif
	read(n,m,k);k--;
	if(k<=0){puts("1");return 0;}
	for(int i=1;i<=n;i++){
		reads(str+1);
		for(int j=1;j<=m;j++)
			a[i][j]=(str[j]=='#');
	}
	for(int i=1;i<=n;i++)
		if(a[i][1]&&a[i][m]) row++;
	for(int j=1;j<=m;j++)
		if(a[1][j]&&a[n][j]) col++;
//	dprintf("%d %d\n",row,col);
	int ccnt=0,pcnt=0,lcnt=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			ccnt+=a[i][j];
	int ans=0;
	if(row&&col) {puts("1");return 0;}
	if(row){
		for(int i=1;i<=n;i++)
			for(int j=1;j<m;j++)
				pcnt+=(a[i][j]&&a[i][j+1]);
		lcnt=row;
	}
	else if(col){
		for(int i=1;i<n;i++)
			for(int j=1;j<=m;j++)
				pcnt+=(a[i][j]&&a[i+1][j]);
		lcnt=col;
	}
	h.a[0][0]=ccnt;h.a[0][1]=mod-pcnt;
	h.a[1][0]=0;h.a[1][1]=lcnt;
	matrix tmp=exp(h,k);
	print((tmp.a[0][0]+tmp.a[0][1])%mod);
	return 0;
}


Measured memory_bytes: 4352