#include<bits/stdc++.h>
            #include<ext/pb_ds/assoc_container.hpp>
            #include<ext/pb_ds/tree_policy.hpp>
            using namespace __gnu_pbds;
            using namespace std;
            # define ll long long
            # define int long long  //comment it out when MLE
            # define endl "\n"
            template <typename T>
            using ordered_set = tree<T, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

            #define gok ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
            //# define m 163577857
            # define mo 1000000007
            # define pi acos(-1)
            # define fi first
            # define se second
            #define REP(i,n) for (int i = 1; i <= n; i++)
            const ll mod = 998244353;
            //const int K = 2;
            //typedef vector<vector<int> > matrix;

   /*        int add(int a, int b,int mod) {
                a%=mod;
                b%=mod;
                a += b;
                if (a >= mod) a -= mod;
                if(a<0)
                {
                    a += mod;
                    a %= mod;
                }
                return a;
            }

            int mul(ll a, int b,int mod) {
                a%=mod;
                b%=mod;
                a *= b;
                a += mod;
                return a % mod;
            }
            int po(int a,int b,int mod)
            {
                if(b==0)
                    return 1;
                if(b%2==0)
                    return po(mul(a,a,mod),b/2,mod);
                return mul(a,po(mul(a,a,mod),(b-1)/2,mod),mod);
            }


            ll fact[2000003];
            ll inv[2000003];

            void fact0()
            {
                int i,j;
                fact[0]=1;
                for(i=1;i<=2000000;i++)
                {
                    fact[i]=i*fact[i-1]%mod;
                }
                inv[0]=1;
                inv[1]=1;
                ll p=mod;
                for (i=2; i<=2000000; i++)
                    inv[i] = (p - (p/i) * inv[p%i] % p) % p;

                for(i=2;i<=2000000;i++)
                {
                    inv[i]*=inv[i-1];
                    inv[i]%=mod;
                }
            }
            int help(int a,int b)
            {
               // cout<<a<<" "<<b<<endl;
                int an = fact[a];
                //cout<<an<<endl;
                an *= inv[b];
                an %= mod;
                an *= inv[a-b];
                an %= mod;
                return an;
            }

        /*   void random()
            {
              srand(time(0));
            for (int i = 0; i < n; i ++)
                perm[i] = i + 1;
            random_shuffle(perm, perm + n);
            }
int ncr(int a,int b)
{
    int tt = fact[a];
    tt %= mod;
    tt *= inv[a-b];
    tt %= mod;
    tt *= inv[b];
    tt %= mod;
    return tt;
}*/

signed main() {
	gok

 int n,m,k;
 cin>>n>>m>>k;
 int a[n],b[m];
 for(int i=0;i<n;i++)
    cin>>a[i];

 for(int i=0;i<m;i++){
    cin>>b[i];
  if(i>0)
  b[i]+=b[i-1];
 }
 int an=0,ss=0,re;
 for(int i=0;i<n;i++)
 {
      re = k - ss;
    // cout<<re<<" ";
     if(re<0)
        continue;
     auto id = upper_bound(b,b+m,re) - b;
    // cout<<id<<endl;
     id--;
     if(b[id]<=re)
        id++;
     if(id<0)
            id=0;
             ss += a[i];
     an = max(an,id+i);
 }
 re = k-ss;
 if(re>=0){
 auto id = upper_bound(b,b+m,re) - b;
    // cout<<id<<endl;
     id--;
     if(b[id]<=re)
        id++;
     if(id<0)
            id=0;
     an = max(an,id+n);
 }
 cout<<an;


















  return 0;
}


Measured memory_bytes: 6776