using System;
using System.Linq;
using System.Collections;
using System.Collections.Generic;

namespace ABC172
{
    using static Ex;
    public class Solve
    {
        public static void Main(string[] args)
        {
            new ABC_C();
        }
    }
    public class ABC_A
    {
        public ABC_A()
        {
            var a = ReadInt;
            (a + a * a + a * a * a).Cw();
        }
    }
    public class ABC_B
    {
        public ABC_B()
        {
            var s = Read;
            var t = Read;
            var l = s.Length;
            long ans = 0;
            for (int i = 0; i < l; i++)
            {
                if (s[i] != t[i]) ans++;
            }
            ans.Cw();
        }
    }
    public class ABC_C
    {
        //机 A, B があります。机 A には N 冊の本が、机 B には M 冊の本
        //K分を超えないようにこの行為を繰り返すとき、最大で何冊の本
        long n, m, k;
        long[] a;
        long[] b;
        long max = 0;
        public ABC_C()
        {
            (n, m, k) = ReadLongArray().ToTpl3();
            a = ReadLongArray();
            b = ReadLongArray();

            max = 0;
            var all = new long[2];
            long aa = -1; long bb = -1;
            for (long i = 0; i < n; i++)
            {
                all[0] += a[i];
                if (all[0] > k)
                {
                    all[0] -= a[i];
                    break;
                }

                Maxs(ref max, i);
                aa = i;
            }
            for (long i = 0; i < m; i++)
            {
                all[1] += b[i];
                if (all[1] > k)
                {
                    all[1] -= b[i];
                    break;
                }

                Maxs(ref max, i);
                bb = i;
            }
            long now = all[0];
            long j = aa;
            long g = 0;
            while (now < k && g < m)
            {
                now += b[g++];
                if (now > k) break;
                Maxs(ref max, j + g + 1);
            }
            while (j >= 0)
            {
                now -= a[j--];
                while (now < k && g < m)
                {
                    now += b[g++];
                    if (now > k) break;
                    Maxs(ref max, j + g + 1);
                }
            }

            now = all[1];
            j = bb;
            g = 0;
            while (now < k && g < n)
            {
                now += a[g++];
                if (now > k) break;
                Maxs(ref max, j + g + 1);
            }
            while (j >= 0)
            {
                now -= b[j--];
                while (now < k && g < n)
                {
                    now += a[g++];
                    if (now > k) break;
                    Maxs(ref max, j + g + 1);
                }
            }

            max.Cw();
        }
    }

    public static class Ex
    {
        public static void Cw(this object s) { Console.WriteLine(s); }



        public static bool Mins<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
        public static bool Maxs<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
        public static void Swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
        public static void Swap<T>(List<T> list, int i, int j) { T tmp = list[j]; list[j] = list[i]; list[i] = tmp; }

        public static long Lcm(int x, int y) { return x / Gcd(x, y) * y; }
        public static long Gcd(long m, long n) { if (n == 0) return m; return Gcd(n, m % n); }
        public static List<string> FastSort(this List<string> s) { s.Sort(StringComparer.Ordinal); return s.ToList(); }
        public static void yesno(this bool b) { (b ? "yes" : "no").Cw(); }
        public static void YesNo(this bool b) { (b ? "Yes" : "No").Cw(); }
        public static void YESNO(this bool b) { (b ? "YES" : "NO").Cw(); }

        public static string Read { get { return Console.ReadLine().Trim(); } }
        public static int ReadInt { get { return int.Parse(Read); } }
        public static long ReadLong { get { return long.Parse(Read); } }
        public static double ReadDouble { get { return double.Parse(Read); } }
        public static string[] ReadArray() { return Read.Split(' '); }
        public static int[] ReadIntArray() { return Read.Split(' ').Select(int.Parse).ToArray(); }
        public static long[] ReadLongArray() { return Read.Split(' ').Select(long.Parse).ToArray(); }
        public static string[] ReadArray(long N) { var v = new string[N]; for (long i = 0; i < N; ++i) v[i] = Read; return v; }
        public static int[] ReadIntArray(long N) { var v = new int[N]; for (long i = 0; i < N; ++i) v[i] = ReadInt; return v; }
        public static long[] ReadLongArray(long N) { var v = new long[N]; for (long i = 0; i < N; ++i) v[i] = ReadLong; return v; }

        public static (T, T) ToTpl2<T>(this T[] v) { return (v[0], v[1]); }
        public static (T, T, T) ToTpl3<T>(this T[] v) { return (v[0], v[1], v[2]); }
        public static (T, T, T, T) ToTpl4<T>(this T[] v) { return (v[0], v[1], v[2], v[3]); }
        public static (T, T, T, T, T) ToTpl5<T>(this T[] v) { return (v[0], v[1], v[2], v[3], v[4]); }
    }
}


Measured memory_bytes: 69688