#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}



using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
using vvvvm = vector<vvvm>;
using vvvvvm = vector<vvvvm>;
using vvvvvvm = vector<vvvvvm>;

vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N, M, K;
    string S;
    cin >> N >> M >> K >> S;

    vb U(26, 0);
    vvvm DP(M + 1, vvm(27, vm(2, 0)));
    DP[0][0][1] = 1;

    mint an = 0;
    rep(i, N) {
        rep(k, 27) {
            DP[i + 1][k][0] += DP[i][k][0] * k;
            if (k != 26)DP[i + 1][k + 1][0] += DP[i][k][0] * (26 - k);

            ll d = S[i] - 'a';
            if (U[d]) {
                DP[i + 1][k][1] += DP[i][k][1];
            }
            else {
                if (k != 26)DP[i + 1][k + 1][1] += DP[i][k][1];
            }
            rep(j, d) {
                if (!U[j]) {
                    if (k != 26)DP[i + 1][k + 1][0] += DP[i][k][1];
                }
                else {
                    DP[i + 1][k][0] += DP[i][k][1];
                }
            }

            
        }
        U[S[i]-'a'] = 1;
    }
    rep(i, M - N) {
        rep(k, 27) {
            DP[i + N + 1][k][0] += DP[i + N][k][0] * k;
            if (k != 26)DP[i + N + 1][k + 1][0] += DP[i + N][k][0] * (26 - k);
            //if(k>=K)an+=DP[i+N+1][k][0];
        }
    }

    rep(i, M) {
        rep(k, 27) {
            if (k >= K) {
                an += DP[i + 1][k][0];
                if (i < N - 1) {
                    an += DP[i + 1][k][1];
                }
            }
        }
    }

    //rep(k,27)if(k>=K)an+=DP[M][k][0];
    cout << an.val() << endl;

}