output_description: Print an integer representing the maximum number of books that can be read.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M K
      A_1 A_2 \ldots A_N
      B_1 B_2 \ldots B_M
attempt: [n, m, k] = list(map(int, input().split()))
  aList = list(map(int, input().split()))
  bList = list(map(int, input().split()))
  numCount = 0
  realVal = 0
  fakeVal = 0
  aList.append(1e10)
  bList.append(1e10)
  while True:
      if aList[0] < bList[0]:
          fakeVal += aList.pop(0)
          numCount += 1
      else:
          fakeVal += bList.pop(0)
          numCount += 1
      if not fakeVal > k:
          realVal = fakeVal
      else:
          numCount -= 1
          break
  print(numCount)
  
problem_description: Statement
  
  We have two desks: A and B. Desk A has a vertical stack of N books on it, and
  Desk B similarly has M books on it.
  
  It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i
  \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq
  i \leq M).
  
  Consider the following action:
  
    * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.
  
  How many books can we read at most by repeating this action so that it takes
  us at most K minutes in total? We ignore the time it takes to do anything
  other than reading.
samples: [{"input": "3 4 240\n    60 90 120\n    80 150 80 150", "output": "3\n    \n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd\nbooks from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st,\n2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the\nmaximum number of books we can read within 240 minutes.\n\n  * Read the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n  * Read the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n  * Read the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\n* * *"}, {"input": "3 4 730\n    60 90 120\n    80 150 80 150", "output": "7\n    \n\n* * *"}, {"input": "5 4 1\n    1000000000 1000000000 1000000000 1000000000 1000000000\n    1000000000 1000000000 1000000000 1000000000", "output": "0\n    \n\nWatch out for integer overflows."}]