#include <bits/stdc++.h>
using namespace std;

int n, m;
long long K;
vector<long long> a, b;   // a: gia sach, b: gia vo; da sap xep tang dan

// Kiem tra co goi duoc t goi qua hay khong.
// Chon t quyen sach re nhat va t quyen vo re nhat; ghep quyen sach re nhat voi vo dat nhat (a tang, b giam).
// Ghep nhu vay la cach tot nhat: neu t goi kha thi thi cach nay cung kha thi.
bool feasible(int t) {
    for (int i = 0; i < t; i++)
        if (a[i] + b[t - 1 - i] > K) return false;
    return true;
}

// Sub 1: vet can - thu t = 1, 2, ... cho den khi khong ghep duoc nua. Dung khi n, m <= 2000.
void sub1() {
    int t = 0;
    while (t < min(n, m) && feasible(t + 1)) t++;
    cout << t << "\n";
}

// Sub 2: day du O(n log n) - tim nhi phan so goi t lon nhat, moi lan kiem tra O(t).
void sub2() {
    int lo = 0, hi = min(n, m);
    while (lo < hi) {
        int mid = (lo + hi + 1) / 2;
        if (feasible(mid)) lo = mid;
        else hi = mid - 1;
    }
    cout << lo << "\n";
}

int main() {
    freopen("GOIQUA.INP", "r", stdin);
    freopen("GOIQUA.OUT", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m >> K;
    a.resize(n);
    b.resize(m);
    for (auto &x : a) cin >> x;
    for (auto &x : b) cin >> x;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    if (n <= 2000 && m <= 2000) sub1();   // du lieu nho: tang dan so goi
    else sub2();
    return 0;
}