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

    using namespace std;

    int main() {
        int n, a, b;
        scanf("%d%d%d", &n, &a, &b);
        vector <int> arr1(a);
        for (int i = 0; i < a; i++) {
            scanf("%d", &arr1[i]);
        }
        vector <int> arr2(b);
        for (int i = 0; i < b; i++) {
            scanf("%d", &arr2[i]);
        }
        sort(arr1.begin(), arr1.end());
        sort(arr2.begin(), arr2.end());
        int total = 0;
        for (int p = 1; p <= n; p++) {
            int i = 0;
            int j = b - 1;
            while (i < a && j >= 0) {
                if (p / arr1[i] == p % arr2[j]) {
                    total++;
                    break;
                }
                else if (p / arr1[i] < p % arr2[j]) {
                    j--;
                }
                else i++;
            }
        }
        printf("%d", total);
        return 0;
    }

#include <vector>
#include <string>
#include <iostream>
#include <iomanip>
#include <algorithm>

using namespace std;

int check(int p, const vector<int>& A, const vector<int>& B)
{
    for(auto b: B)
    {
        int z = p%b;
        auto r = lower_bound(A.begin(),A.end(),p/(z+1));
        for(;r != A.end(); ++r)
        {
            int a = *r;
            if (p/a == z) return 1;
            if (a*z > p) break;
        }
    }
    return 0;

}

int main(int argc, const char * argv[])
{
    int n,ca,cb;
    cin >> n >> ca >> cb;
    vector<int> a(ca),b(cb);
    for(int i = 0; i < ca; ++i) cin >> a[i];
    for(int i = 0; i < cb; ++i) cin >> b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    int count = 0;
    for(int p = 1; p <= n; ++p)
        count += check(p,a,b);
    cout << count << endl;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m, k;
    scanf("%d %d %d",&k,&n,&m);
    vector <int> a(1 + n);
    for (int i = 0;i < n;i++){
        scanf("%d",&a[i]);
    }
    vector <int> b(1 + m);
    for (int i = 0;i < m;i++){
        scanf("%d", &b[i]);
    }
    vector <int> v(m);
    int pair = 0;
    for (int p = 1;p <= k;p++){
        for (int i = 0;i < m;i++){
            v[i] = p % b[i];
        }
        sort(v.begin(),v.end());
        for (int i = 0; i < n; ++i) {
            if (binary_search(v.begin(),v.end(),p / a[i])) {
                pair++;
                break;
            }
        }
    }
    printf("%dn", pair);
    return 0;
}