Problem:
Score : 300 points

Problem 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.

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.

Sample Input 1

3 4 240
60 90 120
80 150 80 150

Sample Output 1

3

In this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.

We can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.

Read the topmost book on Desk A in 60 minutes, and remove that book from the desk.

Read the topmost book on Desk B in 80 minutes, and remove that book from the desk.

Read the topmost book on Desk A in 90 minutes, and remove that book from the desk.

Sample Input 2

3 4 730
60 90 120
80 150 80 150

Sample Output 2

7

Sample Input 3

5 4 1
1000000000 1000000000 1000000000 1000000000 1000000000
1000000000 1000000000 1000000000 1000000000

Sample Output 3

0

Watch out for integer overflows.

Solution in JavaScript (Node.js 12.16.1) (judge verdict: Runtime Error)

function main(input) {
    const [n, m, k] = shaping(input[0]);
    const a = shaping(input[1]);
    const b = shaping(input[2]);
    if (a[0] > k && b[0] > k) { return console.log(0); };
    let timeA = [0];
    let timeB = [0];
    let sumTime = 0;
    let ans = [0];
    //必要最低限のAの累積和
    for (let i = 0; i < n; i++){
        sumTime += a[i];
            if (sumTime == k) {
                timeA.push(sumTime);
                break;
            } else if(sumTime > k){
                break;
            }
        timeA.push(sumTime);
    }
    sumTime = 0;
    for (let i = 0; i < m; i++){
        sumTime += b[i];
        if (sumTime == k) {
            timeB.push(sumTime);
            break;
        } else if (sumTime > k) {
            break;
        }
        timeB.push(sumTime);
    }
    let i = 0;
    let j = timeB.length-1;

    while (i < timeA.length) {
        while (j > -1) {
            if (timeB[j] <= k - timeA[i]) {
                ans.push(i + j);
                break;
            } else {
                j--;
            }
        }
        i++;
    }
    console.log(Math.max(...ans));
}
    
function shaping(arr) { 
    return arr.split(' ').map(Number);
}


main(require('fs').readFileSync('/dev/stdin', 'utf8').trim().split("\n"));