#include <bits/stdc++.h>

using namespace std;

ifstream f("abc2.in");
ofstream g("abc2.out");

typedef unsigned long long int ii;
const int NMAX = 1999;
string s,st;
vector <ii> v[NMAX + 2];
ii put[30],n,m;

bool is(ii x){
    ii i = x % NMAX;
    for(ii it: v[i])
        if(it == x)
            return 1;
    return 0;
}

void add(ii x){
    ii i = x % NMAX;
    v[i].push_back(x);
}

int main(){
    ii i,x,y,ans = 0,j;
    f >> s;
    f >> st;
    n = st.size();
    m = s.size();
    put[0] = 1;
    for(i = 1 ; i <= n ; i++)
        put[i] = put[i - 1] * 3;

    x = 0;
    for(i = 0 ; i < n ; i++){
        x += (st[i] - 'a') * put[i];
    }
    if(!is(x))
        add(x);
    //g << x << " " ;

    while(f >> st){
        x = 0;
        for(i = 0 ; i < n ; i++){
            x += (st[i] - 'a') * put[i];
        }
        if(!is(x))
            add(x);
        //g << x << " ";
    }

    x = 0 ;
    for(i = 0 ; i < n ; i++){
        x += (s[i] - 'a') * put[i];
    }
    //g << "\n\n\n";
    //g << x << " " ;
    if(is(x))
        ans++;

    for(i = n ; i < m ; i++){
        x -= (s[i - n] - 'a');
        x /= 3;
        x += put[n - 1] * (s[i] - 'a');
        if(is(x))
            ans++;
        //g << x << " ";
    }

    g << ans;
    return 0;
}