#include <iostream>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;

ll p(ll x,ll y){
    return y?(p(x*x%mod,y/2)*(y&1?x:1))%mod:1;
}

int main(){
	freopen("Moo.in","r",stdin);
			freopen("Moo.out","w",stdout);
    ll k,n,l,f=1,a=1,o=0; string s;
    cin>>k>>n>>l>>s; s=" "+s;
    
    for(int i=1;i<=k;f=f*i++%mod);
    f=p(f,mod-2);
    
    for(int i=n;i;--i)
        if(s[i]=='O') o++;
        else{
            ll c=1;
            for(ll j=o-k+1;j<=o;c=c*j++%mod);
            a=a*c%mod*f%mod;
            o-=k;
        }
    
    cout<<p(a,l);
}