// UUID: 98dcf9b1-cee3-4f51-a1c8-5e227a3f4d54
#include <bits/stdc++.h>
using namespace std;

int main() {
	int a, b, n; cin >> a >> b >> n;
    int p = a + b; // pont
    vector<int> f(n), s(n);
    for (int i = 0; i < n; i++) cin >> f[i];
    for (int i = 0; i < n; i++) cin >> s[i];
    sort(f.begin(), f.end());
    sort(s.begin(), s.end());

    int i1 = 0, i2 = 0, j1 = n-1, j2 = n-1;
    int out = 1;
    while (i1 <= j1) {
        if (f[j1] + s[i2] > p) {
            j1--;
            j2--;
            out++;
        }
        else {
            j1--;
            i2++;
        }
    }
    cout << out << " ";
    
    i1 = 0, i2 = 0, j1 = n-1, j2 = n-1;
    out = 1;
    while (i1 <= j1) {
        if (f[j1] + s[i2] > p) {
            j1--;
            i2++;
            out++;
        }
        else {
            i1++;
            i2++;
        }
    }
    cout << out << " ";
}