#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

void sort (vi& a)
{
        for (int j = 1; j < a.size(); j++)
    {
        int t = j - 1, p = a[j];
        while(t >= 0 && a[t] > p )
        {
            a[t + 1] = a[t];
            t--;
        }
        a[t + 1] = p;
    }
}

int main()
{
    int n, m, k;
    cin >> n >> m;
    vi a(n, 0);
    vi b(m, 0);

    for (int i = 0; i < n * m ; i++)
        cin >> a[i];
        cin >> k;
    for (int i = 0; i < k; i++)
        cin >> b[k];
    sort(a);
    sort(b);
    int npl = 0, cnt = 0;
    for (int i = 0; i < n; i++)
    {
        while (a[i] > b[npl]
               && npl < n * m)
        {
            npl++;
            if (npl == n * m) break;
            else
            {
                cnt++;
                npl++;
            }
        }
    }

    cout << cnt;



}