#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return a + b; } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; class BIT { public: BIT(ll s) { size = 1; while (size < s) size *= 2; bit.assign(size, 0); // def unit } void update(ll k, ll var) { k += 1; while (k <= size) { bit[k - 1] += var; // def func k += k & -k; } } ll query(ll a) { ll s = 0; a++; while (a > 0) { s += bit[a - 1]; // def func a -= a & -a; } return s; } ll size; vector bit; }; void solve() { ll n, m, k; cin >> n >> m >> k; string s; cin >> s; const int vars = 26; vector use(vars); ll useSum = 0; vector dp(m + 1, vector(vars + 1, 0)); vector sdp(m + 1, vector(vars + 1, 0)); mint2 ans = 0; dp[0][0] = 1; REP(i, m) { REP(j, vars + 1) { if (i < n && useSum == j) { ll v = s[i] - 'a'; if (use[v]) { dp[i + 1][j + 0] += dp[i][j]; } else { dp[i + 1][j + 1] += dp[i][j]; useSum++; use[v] = true; } ll c = 0; REP(i, v) c += use[i]; sdp[i + 1][j + 0] += c * dp[i][j]; if (v - c) sdp[i + 1][j + 1] += (v - c) * dp[i][j]; } if (j < vars) sdp[i + 1][j + 1] += sdp[i][j] * (vars - j); sdp[i + 1][j + 0] += sdp[i][j] * j; if (j >= k) { ans += sdp[i][j]; if (i < n) ans += dp[i][j]; } } } FOR(i, k, vars + 1) { ans += sdp[m][i]; } cout << ans.val(); } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }