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*<sub class="lower-index">*i*</sub> to *r*<sub class="lower-index">*i*</sub> by a character *c*<sub class="lower-index">*i*</sub>. 1.  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* ≤ 200 000, 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*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> and *c*<sub class="lower-index">*i*</sub>, that denotes replacement of all characters at positions from *l*<sub class="lower-index">*i*</sub> to *r*<sub class="lower-index">*i*</sub> by character *c*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ *n*, *c*<sub class="lower-index">*i*</sub> is one of the first *k* lowercase English letters). 1.  Operation of the second type starts with 2 followed by a permutation of the first *k* lowercase English letters.
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*.
7 4 3
abacaba
1 3 5 b
2 abc
1 4 4 c
2 cba
6
5
5 5 3
cbcab
1 2 4 b
2 cab
2 bca
1 2 3 a
1 2 2 c
4
5
10 10 3
cababcacaa
1 3 3 b
2 acb
2 abc
1 8 10 c
1 7 9 c
1 4 7 b
2 cba
1 5 6 a
1 9 9 c
2 acb
7
6
9
8
10 20 5
ebbbcebbea
1 5 9 a
1 1 2 b
2 abdce
2 edacb
2 ebdca
2 cdbae
1 4 9 d
1 1 3 b
1 4 9 e
1 5 9 b
2 cbeda
1 10 10 c
1 6 9 a
1 3 4 c
1 2 3 b
2 aebdc
1 3 9 c
1 2 4 b
1 3 8 b
1 6 10 e
10
10
9
9
8
8
print("_RANDOM_GUESS_1689430665.4070883")# 1689430665.407108