#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//*
using mint=modint998244353;
const ll mod=998244353;
const ld EPS=1e-8;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
int main(){
  ll N,M,K;string S;cin>>N>>M>>K>>S;
  vvm DP(M+1,vm(28));
  DP[0][0]=1;
  REP(j,M)REP(k,27){
  	DP[j+1][k+1]+=DP[j][k]*(26-k);
  	DP[j+1][k]+=DP[j][k]*k;
  }
  REP(i,M)REP(j,28)DP[i+1][j]+=DP[i][j];
  vector<bool>seen(26);
  ll cnt=0;
  mint ans=0;
  REP(i,N-1){
  	if(!seen[S[i]-'a']){seen[S[i]-'a']=1;cnt++;}
  	if(cnt>=K)ans++;
  }
  vm ex(2e6,1),r(2e6);
  FOR(i,1,2e6)ex[i]=i*ex[i-1];
  REP(i,2e6)r[i]=1/ex[i];
  REP(i,26)seen[i]=0;
  cnt=0;
  REP(i,N){
  	ll a=0,b=0;
  	REP(j,S[i]-'a'){
  		if(!seen[j])a++;
  		else b++;
  	}
  	ll c=cnt;
  	ll L=M-i-1,t=max(0LL,K-c);
  	FOR(k,t,27-c)REP(j,c+1)ans+=DP[L][k+j]*ex[26-c]*r[k]*r[26-c-k]*ex[c]*r[j]*r[c-j]*r[26]*ex[k+j]*ex[26-k-j]*b;
  	c++;t=max(0LL,K-c);
  	FOR(k,t,27-c)REP(j,c+1)ans+=DP[L][k+j]*ex[26-c]*r[k]*r[26-c-k]*ex[c]*r[j]*r[c-j]*r[26]*ex[k+j]*ex[26-k-j]*a;
  	if(!seen[S[i]-'a']){seen[S[i]-'a']=1;cnt++;}
  }
  cout<<ans<<endl;
  return 0;
}