{"raw_statement":[{"iden":"problem statement","content":"Takahashi is exploring a cave in a video game.\nThe cave consists of $N$ rooms arranged in a row. The rooms are numbered Room $1,2,\\ldots,N$ from the entrance.\nTakahashi is initially in Room $1$, and the **time limit** is $T$.  \nFor each $1 \\leq i \\leq N-1$, he may consume a time of $A_i$ to move from Room $i$ to Room $(i+1)$. There is no other way to move between rooms. He cannot make a move that makes the time limit $0$ or less.\nThere are $M$ bonus rooms in the cave. The $i$\\-th bonus room is Room $X_i$; when he arrives at the room, the time limit increases by $Y_i$.\nCan Takahashi reach Room $N$?"},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^5$\n*   $0 \\leq M \\leq N-2$\n*   $1 \\leq T \\leq 10^9$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 < X_1 < \\ldots < X_M < N$\n*   $1 \\leq Y_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$ $T$\n$A_1$ $A_2$ $\\ldots$ $A_{N-1}$\n$X_1$ $Y_1$\n$X_2$ $Y_2$\n$\\vdots$\n$X_M$ $Y_M$"},{"iden":"sample input 1","content":"4 1 10\n5 7 5\n2 10"},{"iden":"sample output 1","content":"Yes\n\n*   Takahashi is initially in Room $1$, and the time limit is $10$.\n*   He consumes a time of $5$ to move to Room $2$. Now the time limit is $5$. Then, the time limit increases by $10$; it is now $15$.\n*   He consumes a time of $7$ to move to Room $3$. Now the time limit is $8$.\n*   He consumes a time of $5$ to move to Room $4$. Now the time limit is $3$."},{"iden":"sample input 2","content":"4 1 10\n10 7 5\n2 10"},{"iden":"sample output 2","content":"No\n\nHe cannot move from Room $1$ to Room $2$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}