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