void main() {
	auto ip = readAs!(long[]), N = ip[0], M = ip[1], K = ip[2];
	auto A = readAs!(long[]);
	auto B = readAs!(long[]);
	auto arr = new long[](N+1);
	auto arr2 = new long[](M+1);
	arr[0] = 0;
	arr2[0] = 0;
	foreach(i; 0..N) arr[i+1] = arr[i] + A[i];
	foreach(i; 0..M) arr2[i+1] = arr2[i] + B[i];
	ulong res;
	foreach(i; 0..N+1) {
		if(arr[i] > K) break;
		auto tmp = i + arr2.assumeSorted.lowerBound(K - arr[i] + 1).count - 1;
		debug arr2.assumeSorted.lowerBound(K - arr[i] + 1).writeln;
		res = max(res, tmp);
		debug writefln("i: %d, tmp: %d", i, tmp);
	}
	debug arr.writeln;
	debug arr2.writeln;
	res.writeln;
}

// ===================================

import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
import std.typecons;
import std.uni;
import std.ascii;
import std.bitmanip;
import core.bitop;

T readAs(T)() if (isBasicType!T) {
	return readln.chomp.to!T;
}
T readAs(T)() if (isArray!T) {
	return readln.split.to!T;
}

T[][] readmatrix(T)(uint height, uint width) if (!isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		res[i] = readAs!(T[]);
	}
	return res;
}

T[][] readmatrix(T)(uint height, uint width) if (isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		auto s = rs;
		foreach(j; 0..width) res[i][j] = s[j].to!T;
	}
	return res;
}

int ri() {
	return readAs!int;
}

long rl() {
	return readAs!long;
}

double rd() {
	return readAs!double;
}

string rs() {
	return readln.chomp;
}