#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define PII pair < int , int >
#define MOD 238877 
 
using namespace std;

int n, rs;
string s, c[50100];
vector < ll > Hash[MOD];

ll val, base = 1;

bool find(ll val) {
    for (auto it : Hash[val % MOD]) {
        if (it == val) return 1;
    }

    return 0;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    ifstream cin("abc2.in");
    ofstream cout("abc2.out");

    cin >> s;
    while (cin >> c[++n]) {
        ll value = 0;
        for (int j = 0; j < c[n].size(); j++) {
            value = value * 3 + (c[n][j] - 'a');
        }

        Hash[value % MOD].push_back(value);
    }

    int len = c[1].size();
    for (int i = 0; i < len; i++) {
        base *= 3;
    }

    for (int i = 0; i < s.size(); i++) {
        val = val * 3 + (s[i] - 'a');
        
        if (i >= len) {
            val -= base * (s[i - len] - 'a');
        }

        if (i >= len - 1) {
            rs += find(val);
        }
    }

    cout << rs;

    return 0;
}