#include <fstream>
#include <string>
#include <vector>
#define MOD 10003
using namespace std;
ifstream f("abc2.in");
ofstream g("abc2.out");
string s1, s2;
int N, M, i ,j, sol;
long long cod, p;
vector <int> Map[MOD];
inline bool isThere(long long x) {
    int key = x % MOD;
    for (int i = 0; i < Map[key].size(); ++i)
        if ( Map[key][i] == x ) return 1;
    return 0;
}
inline void Push(long long x){
    int key = x % MOD;
    Map[key].push_back(x);
}
int main() {
    f >> s1;
    f >> s2;
    N = s1.length();
    M = s2.length();
    cod = 0;
    for (i = 0; i < M; ++i) {
        cod = cod * 3 + (s2[i] - 'a') ;
    }
    Push(cod) ;
    while (f >> s2) {
        cod = 0;
        for (i = 0; i < M; ++i) {
            cod = cod * 3 + (s2[i] - 'a');
        }
        Push(cod);
    }
    cod = 0;
    p = 1;
    for (i = 0; i < M; ++i) {
        cod = cod * 3 + (s1[i] - 'a');
        p = p * 3;
    }
    if (isThere(cod)) ++sol;
    p /= 3;
    for (i = M; i < N; ++i) {
        cod = (cod - (s1[i - M] - 'a' ) * p ) * 3 + (s1[i] - 'a');
        if ( isThere(cod)) ++sol;
    }
    g << sol;
    return 0;
}