#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<utility>
#define N 1000005
#define int long long
#define ui unsigned
#define ul unsigned long long
#define db double
#define il __int128
#define mem(x) memset(x,0,sizeof(x))
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,k,fac[N],inv[N],ans=1,op,x,y,z;
char c[N];
const int mod=1e9+7;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
int fp(int a,int n){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int C(int n,int m){
    return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
signed main(){
    freopen("Moo.in","r",stdin);freopen("Moo.out","w",stdout);
    fac[0]=1;fo(i,1,N-1)fac[i]=fac[i-1]*i%mod;
    inv[N-1]=fp(fac[N-1],mod-2);rf(i,N-2,0)inv[i]=inv[i+1]*(i+1)%mod;
    k=read();n=read();m=read();
    scanf("%s",c+1);
    int sum=0;
    rf(i,n,1){
        if(c[i]=='O')sum++;
        else ans=ans*C(sum,k)%mod,sum-=k;
    }
    printf("%lld",fp(ans,m));
    return 0;
}