Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. Encoding

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarp 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*_{mi}*S*_{mi + 1}... *S*_{mi + |T| - 1} by applying the described encoding operation by using some set of pairs of English alphabet letters

Input

The first line of the input contains two integers, |*S*| and |*T*| (1 ≤ |*T*| ≤ |*S*| ≤ 2·10^{5}) — 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.

Output

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.

Examples

Input

11 5

abacabadaba

acaba

Output

3

1 3 7

Input

21 13

paraparallelogramgram

qolorreraglom

Output

1

5

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/03/2020 01:31:07 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|