#include <bits/stdc++.h>   using namespace std;   long long n, m, budget;   long long price[100005], perMoney[100005];   bool can(int k) {     long long curBudget = 0;     int j = 0;     for (int i = k - 1; i >= 0; i--, j++) {       curBudget += max(0ll, price[j] - perMoney[i]);     }     return curBudget <= budget;   }   int main() {     cin >> n >> m >> budget;     for (int i = 0; i < n; i++) cin >> perMoney[i];     for (int i = 0; i < m; i++) cin >> price[i];     sort(price, price + m);     sort(perMoney, perMoney + n);     reverse(perMoney, perMoney + n);     long long lo = 0, hi = min(m, n);     while (lo < hi) {       long long mid = (lo + hi + 1) / 2;       if (can(mid))         lo = mid;       else         hi = mid - 1;     }     long long spent = 0;     for (int i = 0; i < lo; i++) {       spent += price[i];     }     cout << lo <<     << max(0ll, spent - budget) <<   n ;   }   