#include <string>
#include <algorithm>
#include <iostream>
using namespace std;

int search(string db[], string key, int begin, int end) {
        if (begin >= end) {
            return begin;
        }
        int med = (begin+end) / 2;
        int comp = db[med].compare(key);
        if (comp==0) return med;
        else if (comp>0) return search(db, key, begin, med-1);
        else return search(db, key, med+1, end);
}
bool startsWith(string a, string b) {
    if (a.compare(0, b.size(), b) ==0) return true;
}
int main() {
        int n, k;
        scanf("%d %d\n", &n, &k);
        int cnt = 0;
        string book[1001];
        for (int i=0; i<n; i++) {
            getline(cin, book[i]);
        }
        sort(book, book+n);
        for (int j=0; j<k; j++) {
            string nak;
            getline(cin, nak);
            int pos = search(book, nak, 0, n-1);
            if (startsWith(book[pos], nak)) cnt++;
            else {
                if (pos > 0) { if (startsWith(book[pos-1], nak)) {cnt++;continue;} }
                if (pos < n-1) { if (startsWith(book[pos+1], nak)) {cnt++;continue;} }
            }
        }
        printf("%d\n", cnt);


    }