题目描述
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.
Constraints
- $1 \leq N, M \leq 200000$
- $1 \leq K \leq 10^9$
- $1 \leq A_i, B_i \leq 10^9$
- All values in input are integers.
Input
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$
Output
Print an integer representing the maximum number of books that can be read.
Examples
Input
3 4 240
60 90 120
80 150 80 150
Output
3
Input
3 4 730
60 90 120
80 150 80 150
Output
7
Input
5 4 1
1000000000 1000000000 1000000000 1000000000 1000000000
1000000000 1000000000 1000000000 1000000000
Output
0
输入格式
见题面
输出格式
见题面