# import bisect import copy import heapq import itertools import math import operator import random import sys from bisect import bisect, bisect_left, bisect_right, insort from collections import Counter, deque from fractions import Fraction from functools import cmp_to_key, lru_cache, partial from inspect import currentframe from math import ceil, gcd, log10, pi, sqrt from typing import Iterable, Iterator, List, Tuple, TypeVar, Union # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') # import string # import networkx as nx input = sys.stdin.readline sys.setrecursionlimit(10000000) # mod = 10 ** 9 + 7 mod = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return tuple(map(int, input().split())) def read_index(): return tuple(map(lambda x: int(x) - 1, input().split())) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def dprint(*values): print(*values, file=sys.stderr) def dprint2(*values): names = {id(v): k for k, v in currentframe().f_back.f_locals.items()} dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values)) def main(): N, M, K = read_values() S = input().strip() S = [ord(s) - ord("a") for s in S] T = set() dp = [0] * 27 res = 0 for i in range(M): dp2 = [0] * 27 if i < N: for s in range(S[i]): if s in T: dp2[len(T)] += 1 else: dp2[len(T) + 1] += 1 T.add(S[i]) if len(T) >= K: res += 1 res %= mod for d, t in enumerate(dp): dp2[d] += d * t % mod dp2[d] %= mod if d < 26: dp2[d + 1] += t * (26 - d) % mod dp2[d + 1] %= mod res += sum(dp2[K:]) % mod res %= mod dp = dp2 if len(T) >= K: res -= 1 res %= mod print(res) if __name__ == "__main__": main()