Leonid works for a small and promising start-up that works on decoding the human genome. His duties include solving complex problems of finding certain patterns in long strings consisting of letters 'A', 'T', 'G' and 'C'.

Let's consider the following scenario. There is a fragment of a human DNA chain, recorded as a string S. To analyze the fragment, you need to find all occurrences of string T in a string S. However, the matter is complicated by the fact that the original chain fragment could contain minor mutations, which, however, complicate the task of finding a fragment. Leonid proposed the following approach to solve this problem.

Let's write down integer k ≥ 0 — the error threshold. We will say that string T occurs in string S on position i (1 ≤ i ≤ |S| - |T| + 1), if after putting string T along with this position, each character of string T corresponds to the some character of the same value in string S at the distance of at most k. More formally, for any j (1 ≤ j ≤ |T|) there must exist such p (1 ≤ p ≤ |S|), that |(i + j - 1) - p| ≤ k and S[p] = T[j].

For example, corresponding to the given definition, string "ACAT" occurs in string "AGCAATTCAT" in positions 2, 3 and 6.

<image>

Note that at k = 0 the given definition transforms to a simple definition of the occurrence of a string in a string.

Help Leonid by calculating in how many positions the given string T occurs in the given string S with the given error threshold.

Input

The first line contains three integers |S|, |T|, k (1 ≤ |T| ≤ |S| ≤ 200 000, 0 ≤ k ≤ 200 000) — the lengths of strings S and T and the error threshold.

The second line contains string S.

The third line contains string T.

Both strings consist only of uppercase letters 'A', 'T', 'G' and 'C'.

Output

Print a single number — the number of occurrences of T in S with the error threshold k by the given definition.

Examples

Input

10 4 1
AGCAATTCAT
ACAT


Output

3

Note

If you happen to know about the structure of the human genome a little more than the author of the problem, and you are not impressed with Leonid's original approach, do not take everything described above seriously.
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int N = 800050;
void fft(complex<double> a[], int n, bool inv) {
  for (int i = 1, j = 0; i < n; i++) {
    int k = n;
    do j ^= k >>= 1;
    while (~j & k);
    if (j > i) swap(a[i], a[j]);
  }
  for (int j = 2; j <= n; j <<= 1) {
    double ang = PI * 2 / j * (inv ? -1 : 1);
    complex<double> mul(cos(ang), sin(ang));
    int block = n / j;
    for (int i = 0; i < block; i++) {
      complex<double> cur(1, 0);
      for (int k = i * j; k < i * j + j / 2; k++) {
        complex<double> tmp = cur * a[k + j / 2];
        a[k + j / 2] = a[k] - tmp;
        a[k] += tmp;
        cur = cur * mul;
      }
    }
  }
  if (inv)
    for (int i = 0; i < n; i++) a[i] /= n;
}
char s[N], t[N];
int n, m, k;
int a[N], b[N], ans[N], sum[N];
complex<double> A[N], B[N];
void Build(char ch) {
  for (int i = 0; i < n; i++) a[i] = s[i] == ch, sum[i] = a[i];
  for (int i = 1; i < n; i++) sum[i] += sum[i - 1];
  for (int i = 0; i < n; i++)
    a[i] = sum[min(n - 1, i + k)] - (i - k - 1 < 0 ? 0 : sum[i - k - 1]),
    a[i] = min(a[i], 1);
  for (int i = 0; i < m; i++) b[m - i - 1] = t[i] == ch;
}
void Solve() {
  int sz = 1;
  while (sz < n) sz <<= 1;
  sz <<= 1;
  for (int i = n; i < sz; i++) a[i] = 0;
  for (int i = m; i < sz; i++) b[i] = 0;
  for (int i = 0; i < sz; i++)
    A[i] = complex<double>(a[i], 0), B[i] = complex<double>(b[i], 0);
  fft(A, sz, 0);
  fft(B, sz, 0);
  for (int i = 0; i < sz; i++) A[i] = A[i] * B[i];
  fft(A, sz, 1);
  for (int i = m - 1; i < m - 1 + n; i++) ans[i - m + 1] += round(A[i].real());
}
int main() {
  scanf("%i %i %i %s %s", &n, &m, &k, s, t);
  Build('A');
  Solve();
  Build('G');
  Solve();
  Build('T');
  Solve();
  Build('C');
  Solve();
  int sol = 0;
  for (int i = 0; i < n; i++) sol += ans[i] == m;
  printf("%i\n", sol);
  return 0;
}
