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 mi in S (1 ≤ mi ≤ |S| - |T| + 1), such that T can be obtained fro substring SmiSmi + 1... Smi + |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·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.

Output

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

In the next line print k integers m1, m2, ..., mk — 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
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
vector<int> ans;
string s, t;
int n, m;
bool f[N][26];
void solve(int a, int b) {
  string str;
  str.clear();
  for (char c : t) {
    if (c - 'a' == a)
      str += c;
    else if (c - 'a' == b)
      str += c;
    else
      str += '.';
  }
  str += '#';
  for (char c : s) {
    if (c - 'a' == a)
      str += b + 'a';
    else if (c - 'a' == b)
      str += a + 'a';
    else
      str += '.';
  }
  vector<int> z(n + m + 1, 0);
  int l = 0;
  int r = 0;
  for (int i = 1; i <= n + m; i++) {
    int &x = z[i];
    if (i <= r) x = min(z[i - l], r - i);
    while (i + x <= n + m && str[x] == str[i + x]) x++;
    if (i + x >= r) {
      l = i;
      r = i + x;
    }
    if (x == m) f[i - m][a] = f[i - m][b] = true;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  cin >> s >> t;
  for (int i = 0; i < 26; i++)
    for (int j = i; j < 26; j++) {
      solve(i, j);
    }
  for (int i = 1; i <= n; i++) {
    ans.push_back(i);
    for (int j = 0; j <= 25; j++) {
      if (!f[i][j]) {
        ans.pop_back();
        break;
      }
    }
  }
  cout << ans.size() << "\n";
  for (int x : ans) cout << x << " ";
  return 0;
}
