CF1065E Side Transmutations

考虑一个字符集合$A$（$A$中元素互不相同）和一个长度为$n$的字符串$S$，其中$S$中的字符都属于集合$A$。 给你一个包含 $m$ 个整数的序列 $b$ ($b_1

无

无

Here are all the distinct strings for the first example. The chosen letters 'a' and 'b' are there just to show that the characters in $ A $ are different. 1. "aaa" 2. "aab" = "baa" 3. "aba" 4. "abb" = "bba" 5. "bab" 6. "bbb"