#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

#define MOD 666013

using namespace std;

vector<long long> Hash[MOD];
vector<long long>::iterator Val;

int i, j, len, Queries, Sol;
long long Nr;
char S[22];

int main() {
    freopen("dtcsu.in", "r", stdin);
    freopen("dtcsu.out", "w", stdout);

    for(i = 0; i < 2; ++i) {

        fgets(S, 22, stdin);

        len = strlen(S) - 1;
        for(Nr = 0, j = 0; j < len; ++j)
            Nr = Nr*10 + (long long)(S[j]-'0');

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

    scanf("%d", &Queries);
    Sol = 0;
    while(Queries--) {

        scanf("%I64d", &Nr);
        i = Nr%MOD;
        for(Val = Hash[i].begin(); Val != Hash[i].end(); ++Val)
            if(*Val == Nr) {
                ++Sol;
                break;
            }
    }

    printf("%d\n", Sol);

    return 0;
}