CF533F.Encoding

Polycarp invented a new way to encode strings. Let's assume that we have string T, consisting of lowercase English letters. Let's choose several pairs of letters of the English alphabet in such a way that each letter occurs in at most one pair. Then let's replace each letter in T with its pair letter if there is a pair letter for it. For example, if you chose pairs (l, r), (p, q) and (a, o), then word "parallelogram" according to the given encoding principle transforms to word "qolorreraglom".

Polycarpus already has two strings, S and T. He suspects that string T was obtained after applying the given encoding method from some substring of string S. Find all positions m__i in S (1 ≤ m__i ≤ |S| - |T| + 1), such that T can be obtained fro substring S__m__i__S__m__i + 1... S__m__i + |T| - 1 by applying the described encoding operation by using some set of pairs of English alphabet letters

Polycarp 发明了一种新的字符串编码方法。假设我们有一个由小写英文字母组成的字符串 $T$。我们选择若干对英文字母，使得每个字母至多出现在其中一对中。然后，对于 $T$ 中的每个字母，若其存在配对字母，则将其替换为该配对字母。例如，若你选择了配对 $(l, r)$、$(p, q)$ 和 $(a, o)$，则根据上述编码规则，单词 “parallelogram” 将被转换为 “qolorreraglom”。

Polycarpus 已经拥有两个字符串 $S$ 和 $T$。他怀疑字符串 $T$ 是通过对字符串 $S$ 的某个子串应用上述编码方法得到的。请找出所有满足条件的位置 $m_i$（$1 \le m_i \le |S| - |T| + 1$），使得通过选取某组英文字母配对，可将 $S$ 中从位置 $m_i$ 开始、长度为 $|T|$ 的子串 $S_{m_i} S_{m_i+1} \dots S_{m_i + |T| - 1}$ 编码为 $T$。

The first line of the input contains two integers, |S| and |T| (1 ≤ |T| ≤ |S| ≤ 2·105) — the lengths of string S and string T, respectively.

The second and third line of the input contain strings S and T, respectively. Both strings consist only of lowercase English letters.

输入的第一行包含两个整数 $|S|$ 和 $|T|$（$1 ≤ |T| ≤ |S| ≤ 2·10^5$），分别表示字符串 $S$ 和字符串 $T$ 的长度。

输入的第二行和第三行分别包含字符串 $S$ 和 $T$。两个字符串均由小写英文字母组成。

Print number k — the number of suitable positions in string S.

In the next line print k integers _m_1, _m_2, ..., m__k — the numbers of the suitable positions in the increasing order.

输出整数 k —— 字符串 S 中合适位置的个数。

在下一行输出 k 个整数 _m_₁, _m_₂, ..., m__k —— 按升序排列的合适位置的编号。