#include <bits/stdc++.h>   const long long int MOD = 1000000007ll;   const int mxsz = 200005;   using namespace std;   int main() {     std::ios_base::sync_with_stdio(false);     long long int n, m, a;     cin >> n >> m >> a;     int ar1[n + 1], ar2[m + 1];     for (int i = 1; i <= n; i++) {       cin >> ar1[i];     }     for (int i = 1; i <= m; i++) {       cin >> ar2[i];     }     sort(ar1 + 1, ar1 + n + 1);     sort(ar2 + 1, ar2 + m + 1);     vector<long long int> b, p;     for (int i = 1; i <= min(n, m); i++) {       b.push_back(ar1[n - i + 1]);       p.push_back(ar2[i]);     }     int l = 0, r = min(n, m);     int ans = 0;     while (l <= r) {       int mid = (l + r) / 2;       long long int tmp = a;       for (int i = 0; i < mid; i++) {         tmp -= (long long int)max(0LL, p[mid - i - 1] - b[i]);         if (tmp < 0) {           break;         }       }       if (tmp >= 0) {         l = mid + 1;         ans = mid;       } else {         r = mid - 1;       }     }     cout << ans <<    ;     long long int tmp = 0;     for (int i = 0; i < ans; i++) {       tmp += (long long int)p[i];     }     cout << max(0LL, tmp - a);     return 0;   }   