#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define vvll vector<vll>
#define all(v) v.begin(),v.end()
#define itr(r,v) for(auto r=v.begin();r!=v.end();r++)
#define W while
#define FOR(i,n) for(ll i=0;i<n;i++)
#define ffor(i,a,b) for(ll i=a;i<=b;i++)
#define rfor(i,a,b) for(ll i=a;i>=b;i--)
#define space cout<<"\n\n";
#define endl "\n"
#define pqmx priority_queue<ll>
#define pqmn priority_queue<ll,vll,greater<ll>>
#define fps(x,y) fixed<<setprecision(y)<<x
#define merg(a,b,c) set_union(a.begin(),a.end(),b.begin(),b.end(),inserter(c,c.begin()))
#define set_ar(arr,v) memset(arr,v,sizeof(arr))
#define ctime auto start = high_resolution_clock::now()
#define etime auto stop = high_resolution_clock::now()
#define ptime auto z1z = duration_cast<microseconds>(stop-start); cout<<"Time elapsed : "<<z1z.count()<<" microseconds\n"
#define go_t ll testcases; cin>>testcases; while(testcases--)
#define dbg1(x)             cout <<#x<<": "<<x<<'\n';
#define dbg2(x, y)          cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<'\n';
#define dbg3(x, y, z)       cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<'\n';
#define dbg4(a, b, c, d)    cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<'\n';
#define dbg5(a, b, c, d, e) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<'\n';
using namespace std;
using namespace std::chrono;

const ll MOD = 1e9 + 7;
const ll N = 1e6 + 6;
const ll maxN = 2e5 + 5;
const ll MAX_SIZE = 1e8 + 8;
const double PI = 3.14159265359;

ll powerM(ll x, ll y, ll M = MOD) // default argument
{ll v = 1; x = x % M; while (y > 0) {if (y & 1)v = (v * x) % M; y = y >> 1; x = (x * x) % M;} return v;}

ll power(ll x, ll y)
{ll v = 1; while (y > 0) {if (y & 1)v = v * x; y = y >> 1; x = x * x;} return v;}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("input1.txt", "r", stdin);
	freopen("output1.txt", "w", stdout);
#endif
	// WHILE(!(SUCCEED == TRY()));
	// BEFORE WRITING MAKE SURE YOU HAVE ANALYSED THE CONSTRAINTS
	// AND THINK THROUGH THE LOGIC ONCE MORE
	FIO
	ll n, m, k; cin >> n >> m >> k;
	vll a(n);
	vll b(m);
	ll ans = 0;
	FOR(i, n) cin >> a[i];
	FOR(i, m) cin >> b[i];
	for (ll i = 1; i < n; i++) {
		a[i] += a[i - 1];
	}
	for (ll j = 1; j < m; j++) {
		b[j] += b[j - 1];
	}
	for (ll i = 0; i < n; i++) {
		// cout << "h1\n";
		// dbg1(ans);
		ll rem = k - a[i];
		ll temp = i + 1;
		if (rem < 0) {
			break;
		}
		auto it = upper_bound(all(b), rem);
		if (it == b.begin()) {
		}
		else it--;
		// dbg3(ans, temp, (it - b.begin()));
		ll val = 1 + temp + it - b.begin();
		if (it == b.begin() && b[0] != rem)
			val--;
		ans = max(ans, val);
	}
	for (ll i = 0; i < m; i++) {
		// cout << "h2\n";
		// dbg1(ans);
		ll rem = k - b[i];
		ll temp = i + 1;
		if (rem < 0) {
			break;
		}
		auto it = upper_bound(all(a), rem);
		if (it == a.begin()) {
		}
		else it--;
		ll val = 1 + temp + it - a.begin();
		if (it == a.begin() && a[0] != rem)
			val--;
		ans = max(ans, val);
	}
	cout << ans;
	return 0;
}


Measured memory_bytes: 6368