Inexact match

Input

The first line contains the string $\text{p}$, and the second line contains the string $\text{t}$, where 1 \leq |\textbf{p}|,\, |\textbf{t}| \leq 10^6. Both strings consist of letters from the Latin alphabet.

Output

On the first line, print the number of occurrences where $\text{p}$ appears in $\text{t}$ with at most one character mismatch. On the second line, print, in ascending order, the starting indices in $\text{t}$ where each such occurrence begins. Number the positions starting from $1$.

Examples