#pragma GCC diagnostic ignored "-Wunused-variable" 
#include <bits/stdc++.h>
using namespace std;

#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost;
using ml = multiprecision::cpp_int;
using md = multiprecision::cpp_dec_float_100;
#endif

/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x) do { cout << x << endl; exit(0); } while(0)
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...) if (ll i = -1) for(__VA_ARGS__) if (i++, 1)
#define each(i, e, c) fori (i, auto&& e: c)      // for each
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define pi 3.1415926535897932                    // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
(auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
(auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
(auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };

/***** operator *****/
template <class T, class S> pair<T, S> operator + (pair<T, S> l, pair<T, S> r)
{	// pair<T, S> + pair<T, S>
	return { l.first + r.first, l.second + r.second };
}
template <class T, class S> pair<T, S> operator - (pair<T, S> l, pair<T, S> r)
{	// pair<T, S> - pair<T, S>
	return { l.first - r.first, l.second - r.second };
}

/***** template *****/
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{	// vector<vector<T>> resize + fill
	v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{	// vector<vector<vector<T>>> resize + fill
	v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{	// input vector<vector<T>> (T != struct) + fix
	MakeVVT(ys, xs, v, fix);
	rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{	// input vector<vector<vector<T>>> (T != struct) + fix
	v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget
{
	/***** DFSライブラリ *****/

	struct GT_NyaaDFS
	{	// 結果を格納する変数
		long long maxres = 0;
		std::vector<long long> res;
		map<ll, ll> px;

		/**
		@brief DFS処理関数
		@param r 頂点vの根
		@param v 現在の頂点
		@param g 隣接リストか隣接行列
		**/
		decltype(res)& Run(long long r, long long v, const std::vector<std::vector<long long>>& g)
		{	// 初期化
			if (r == -1) res.resize(g.size()), res[v] = px[v];

			for (auto&& e : g[v])
			{	// 後戻りしないようにする
				if (e == r) continue;
				if (res[e] != 0) continue;
				res[e] = res[v] + px[e];
				Run(v, e, g);
			}
			return res;
		}

		/**
		@brief バックトラックDFS処理関数
		@param r 頂点vの根
		@param v 現在の頂点
		@param g 隣接リストか隣接行列
		**/
		decltype(maxres) Backtrack(long long r, long long v, const std::vector<std::vector<long long>>& g)
		{	// 初期化
			if (r == -1) res.resize(g.size()), res[v] = 1;

			maxres = std::max(maxres, res[v]);
			for (auto&& e : g[v])
			{	// 後戻りしないようにする
				if (e == r) continue;
				if (res[e] != 0) continue;
				res[e] = res[v] + 1;
				Backtrack(v, e, g);
				// バックトラックなので元に戻す
				res[e] = 0;
			}
			return maxres;
		}
	};
}

namespace NyaGadget
{
	/***** 累積和ライブラリ *****/

	template <class T> struct DS_NyaaCumulativeSum
	{
		std::vector<T> sum;
		DS_NyaaCumulativeSum(std::vector<T>& v)
		{
			if (v.empty()) sum.push_back(0);
			else sum.push_back(v.front());
			for (long long i = 1; i < (long long)v.size(); ++i) sum.push_back(sum.back() + v[i]);
		}
		/**
		@brief 範囲の合計値を取得する
		@note
		 閉区間[s, t)の合計値を返す。
		 範囲外のsやtに対しては0を返す。
		**/
		T Range(long long s, long long t)
		{
			if (s < 0) s = 0;
			if ((long long)sum.size() < t) t = (long long)sum.size();
			// 戻り値の計算
			if (t <= 0 || (long long)sum.size() <= s) return 0;
			return (s == 0) ? sum[t - 1] : sum[t - 1] - sum[s - 1];
		}
	};
}

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
//using mll = NT_ModLL< 1000000007 >;
//using mll = ModLL< 998244353 >;

int main()
{
	ll N, M, K; cin >> N >> M >> K;
	vt<ll> A(N); each(i, e, A) cin >> e;
	vt<ll> B(M); each(i, e, B) cin >> e;

	ll ans = 0;
	DS_NyaaCumulativeSum asum(A), bsum(B);
	rep(i, 0, N+1)
	{
		if (K < asum.Range(0, i)) break;
		auto it = lower_bound(all(bsum.sum), K - asum.Range(0, i) + 1);
		ans = max(ans, i + (it - bsum.sum.begin()));
	}
	rep(i, 0, M+1)
	{
		if (K < bsum.Range(0, i)) break;
		auto it = lower_bound(all(asum.sum), K - bsum.Range(0, i) + 1);
		ans = max(ans, i + (it - asum.sum.begin()));
	}
	cout << ans;

	return 0;
}


Measured memory_bytes: 11056