Alphabet Permutations

给定一个长度为 $n\ (n<=200000)$ 的字符串 $s$ ，且 $s$ 仅包含前 $k$ 个小写字母，有两种操作： 1.将区间 $[L,R]$ 内的字符变为 $ch$。 2.给定长度为 $k$ 的字符串排列 $t$（前 $k$ 个小写字母构成的字符串排列），向 $s$ 串中添加字符，使得 $t$ 是 $s$ 的一个循环节，求最少的循环次数（即 $\dfrac{|S|}{|T|}$ ）。 $2$ 操作相互之间独立。 最多 $20000$ 次操作，$k\le 10$。

You are given a string $ s $ of length $ n $ , consisting of first $ k $ lowercase English letters. We define a $ c $ -repeat of some string $ q $ as a string, consisting of $ c $ copies of the string $ q $ . For example, string "acbacbacbacb" is a $ 4 $ -repeat of the string "acb". Let's say that string $ a $ contains string $ b $ as a subsequence, if string $ b $ can be obtained from $ a $ by erasing some symbols. Let $ p $ be a string that represents some permutation of the first $ k $ lowercase English letters. We define function $ d(p) $ as the smallest integer such that a $ d(p) $ -repeat of the string $ p $ contains string $ s $ as a subsequence. There are $ m $ operations of one of two types that can be applied to string $ s $ : 1. Replace all characters at positions from $ l_{i} $ to $ r_{i} $ by a character $ c_{i} $ . 2. For the given $ p $ , that is a permutation of first $ k $ lowercase English letters, find the value of function $ d(p) $ . All operations are performed sequentially, in the order they appear in the input. Your task is to determine the values of function $ d(p) $ for all operations of the second type.

The first line contains three positive integers $ n $ , $ m $ and $ k $ ( $ 1<=n<=200000,1<=m<=20000,1<=k<=10 $ ) — the length of the string $ s $ , the number of operations and the size of the alphabet respectively. The second line contains the string $ s $ itself. Each of the following lines $ m $ contains a description of some operation: 1. Operation of the first type starts with $ 1 $ followed by a triple $ l_{i} $ , $ r_{i} $ and $ c_{i} $ , that denotes replacement of all characters at positions from $ l_{i} $ to $ r_{i} $ by character $ c_{i} $ ( $ 1<=l_{i}<=r_{i}<=n $ , $ c_{i} $ is one of the first $ k $ lowercase English letters). 2. Operation of the second type starts with $ 2 $ followed by a permutation of the first $ k $ lowercase English letters.

For each query of the second type the value of function $ d(p) $ .

7 4 3
abacaba
1 3 5 b
2 abc
1 4 4 c
2 cba

6
5

After the first operation the string $ s $ will be abbbbba. In the second operation the answer is $ 6 $ -repeat of abc: ABcaBcaBcaBcaBcAbc. After the third operation the string $ s $ will be abbcbba. In the fourth operation the answer is $ 5 $ -repeat of cba: cbAcBacBaCBacBA. Uppercase letters means the occurrences of symbols from the string $ s $ .