#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7,N=1e6+5;
int k,n,l,fac[N],inv[N];
string s;
int c(int x,int y){return fac[x]*inv[y]%mod*inv[x-y]%mod;}
int qpow(int x,int y){
	int res=1;
	while(y){
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
signed main(){
	freopen("Moo.in","r",stdin);
	freopen("Moo.out","w",stdout);
	fac[0]=1;
	for(int i = 1;i<=1e6;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=qpow(fac[1000000],mod-2);
	for(int i = 1e6-1;i>=0;i--)
	inv[i]=inv[i+1]*(i+1)%mod;
	scanf("%lld%lld%lld",&k,&n,&l);
	cin>>s; int num=0,ans=1;
	for(int i = s.size()-1;i>=0;i--){
		if(s[i]=='O') num++;
		else ans=ans*c(num,k)%mod,num-=k;
	}
	printf("%lld",qpow(ans,l));
	return 0;
}