#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


vector<int> z_algorithm(string s){
    int n = (int)s.size();
    vector<int> z(n);
    z[0] = n;
    int i=1, j=0;
    while(i < n){
        while(i+j<n && s[j]==s[i+j]) j++;
        z[i] = j;

        if(j == 0){
            i++;
            continue;
        }

        int k=1;
        while(k < j && k+z[k]<j){
            z[i+k] = z[k];
            k++;
        }
        i += k;
        j -= k;
    }

    return z;
}

#include <atcoder/convolution>
using namespace atcoder;

void solve(){
    ll n, m, k; cin >> n >> m >> k;
    string s, t; cin >> s >> t;
    vector<ll> a(n, -1), b(m, -1);
    for(ll i=0; i<n; i++){
        if('A'<=s[i] && s[i]<='Z'){
            s[i] = (char)('a' + (ll)(s[i]-'A'));
            a[i] = 1;
        }
    }
    for(ll i=0; i<m; i++){
        if('A'<=t[i] && t[i]<='Z'){
            t[i] = (char)('a' + (ll)(t[i]-'A'));
            b[i] = 1;
        }
    }

    string r = t+s;
    vector<int> z = z_algorithm(r);

    reverse(all(b));
    vector<ll> c = convolution(a, b);

    ll ans = 0;
    rep(i, n){
        if(z[m+i]<m) continue;
        ll cnt = (m-c[m-1+i])/2;
        if(1<=cnt&&cnt<=k) ans++;
    }
    cout << ans << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}