#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

vector<int> Z_algorithm(string S) {
    vector<int>Z(S.size());
    Z[0] = S.size();
    int i = 1,j = 0;
    while(i < S.size()) {
        while(i+j < S.size() && S[i+j] == S[j]) {
            j++;
        }
        Z[i] = j;
        if(j == 0) {
            i++;
            continue;
        }
        int k = 1;
        while(k+Z[k] < j) {
            Z[i+k] = Z[k];
            k++;
        }
        i += k;
        j -= k;
    }
    return Z;
}

namespace FastFourierTransform {
using real = double;

struct C {
    real x, y;
    
    C() : x(0), y(0) {}
    
    C(real x, real y) : x(x), y(y) {}
    
    inline C operator+(const C &c) const { return C(x + c.x, y + c.y); }
    
    inline C operator-(const C &c) const { return C(x - c.x, y - c.y); }
    
    inline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }
    
    inline C conj() const { return C(x, -y); }
};

const real PI = acosl(-1);
int base = 1;
vector< C > rts = { {0, 0},
    {1, 0} };
vector< int > rev = {0, 1};


void ensure_base(int nbase) {
    if(nbase <= base) return;
    rev.resize(1 << nbase);
    rts.resize(1 << nbase);
    for(int i = 0; i < (1 << nbase); i++) {
        rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
    }
    while(base < nbase) {
        real angle = PI * 2.0 / (1 << (base + 1));
        for(int i = 1 << (base - 1); i < (1 << base); i++) {
            rts[i << 1] = rts[i];
            real angle_i = angle * (2 * i + 1 - (1 << base));
            rts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));
        }
        ++base;
    }
}

void fft(vector< C > &a, int n) {
    assert((n & (n - 1)) == 0);
    int zeros = __builtin_ctz(n);
    ensure_base(zeros);
    int shift = base - zeros;
    for(int i = 0; i < n; i++) {
        if(i < (rev[i] >> shift)) {
            swap(a[i], a[rev[i] >> shift]);
        }
    }
    for(int k = 1; k < n; k <<= 1) {
        for(int i = 0; i < n; i += 2 * k) {
            for(int j = 0; j < k; j++) {
                C z = a[i + j + k] * rts[j + k];
                a[i + j + k] = a[i + j] - z;
                a[i + j] = a[i + j] + z;
            }
        }
    }
}

vector< long long > multiply(const vector< int > &a, const vector< int > &b) {
    int need = (int) a.size() + (int) b.size() - 1;
    int nbase = 1;
    while((1 << nbase) < need) nbase++;
    ensure_base(nbase);
    int sz = 1 << nbase;
    vector< C > fa(sz);
    for(int i = 0; i < sz; i++) {
        int x = (i < (int) a.size() ? a[i] : 0);
        int y = (i < (int) b.size() ? b[i] : 0);
        fa[i] = C(x, y);
    }
    fft(fa, sz);
    C r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);
    for(int i = 0; i <= (sz >> 1); i++) {
        int j = (sz - i) & (sz - 1);
        C z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;
        fa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;
        fa[i] = z;
    }
    for(int i = 0; i < (sz >> 1); i++) {
        C A0 = (fa[i] + fa[i + (sz >> 1)]) * t;
        C A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];
        fa[i] = A0 + A1 * s;
    }
    fft(fa, sz >> 1);
    vector< long long > ret(need);
    for(int i = 0; i < need; i++) {
        ret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);
    }
    return ret;
}
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M,K;
    cin >> N >> M >> K;
    string S,T;
    cin >> S >> T;
    string R = T+S;
    for(int i = 0; i < R.size(); i++) {
        if('A' <= R[i] && R[i] <= 'Z') {
            R[i] = (char)(R[i]-'A'+'a');
        }
    }
    vector<int>a = Z_algorithm(R);
    vector<int>b(N),c(M),b2(N,1),c2(M,1);
    for(int i = 0; i < S.size(); i++) {
        if('A' <= S[i] && S[i] <= 'Z') {
            b[i] = 1;
            b2[i] = 0;
        }
    }
    for(int i = 0; i < T.size(); i++) {
        if('a' <= T[i] && T[i] <= 'z') {
            c[T.size()-i-1] = 1;
            c2[T.size()-i-1] = 0;
        }
    }
    vector<long long>d = FastFourierTransform::multiply(b,c);
    vector<long long>d2 = FastFourierTransform::multiply(b2,c2);
    int ans = 0;
    for(int i = 0; i+M <= N; i++) {
        int now = d[M-1+i]+d2[M-1+i];
        if(a[i+M] >= M && 1 <= now && now <= K) {
            ans++;
        }
    }
    cout << ans << "\n";
}