#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
const int N=1000010,MOD=1e9+7;
int k,n,l,ans=1,last,mul;
char c[N];
int jc[N];
int qpow(int a,int b=MOD-2)
{
    mul=1;
    for(;b;a=a*a%MOD,b>>=1) if(b&1) mul=mul*a%MOD;
    return mul;
}
int C(int a,int b){return jc[a]*qpow(jc[a-b])%MOD*qpow(jc[b])%MOD;}
signed main()
{
    freopen("Moo.in","r",stdin);
    freopen("Moo.out","w",stdout);
    k=re();n=re();l=re();
    if(k>n)
    {
        printf("0");
        return 0;
    }
    jc[0]=1;for(int i=1;i<=N-10;i++) jc[i]=jc[i-1]*i%MOD;
    scanf("%s",c);
    for(int i=n-1;i>=0;i--)
    {
        if(c[i]=='O') last++;
        else if(last<k)
        {
            ans=0;
            break;
        }
        else ans=ans*C(last,k)%MOD,last-=k;
    }
    ans=qpow(ans,l);
    printf("%lld",ans);
    return 0;
}