{"problem":{"name":"Range Add Query","description":{"content":"You are given an integer sequence of length $N$, $A = (A_1, A_2, \\ldots, A_N)$, and a positive integer $K$. For each $i = 1, 2, \\ldots, Q$, determine whether a contiguous subsequence of $A$, $(A_{l_i}","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc288_d"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence of length $N$, $A = (A_1, A_2, \\ldots, A_N)$, and a positive integer $K$.\nFor each $i = 1, 2, \\ldots, Q$, determine whether a contiguous subsequence of $A$, $(A_{l_i}, A_{l_i+1}, \\ldots, A_{r_i})$, is a **good sequence**.\nHere, a sequence of length $n$, $X = (X_1, X_2, \\ldots, X_n)$, is **good** if and only if there is a way to perform the operation below some number of times (possibly zero) to make all elements of $X$ equal $0$.\n\n> Choose an integer $i$ such that $1 \\leq i \\leq n-K+1$ and an integer $c$ (possibly negative). Add $c$ to each of the $K$ elements $X_{i}, X_{i+1}, \\ldots, X_{i+K-1}$.\n\nIt is guaranteed that $r_i - l_i + 1 \\geq K$ for every $i = 1, 2, \\ldots, Q$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq K \\leq \\min\\lbrace 10, N \\rbrace$\n*   $-10^9 \\leq A_i \\leq 10^9$\n*   $1 \\leq Q \\leq 2 \\times 10^5$\n*   $1 \\leq l_i, r_i \\leq N$\n*   $r_i-l_i+1 \\geq K$\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n$Q$\n$l_1$ $r_1$\n$l_2$ $r_2$\n$\\vdots$\n$l_Q$ $r_Q$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc288_d","tags":[],"sample_group":[["7 3\n3 -1 1 -2 2 0 5\n2\n1 6\n2 7","Yes\nNo\n\nThe sequence $X \\coloneqq (A_1, A_2, A_3, A_4, A_5, A_6) = (3, -1, 1, -2, 2, 0)$ is good. Indeed, you can do the following to make all elements equal $0$.\n\n*   First, do the operation with $i = 2, c = 4$, making $X = (3, 3, 5, 2, 2, 0)$.\n*   Next, do the operation with $i = 3, c = -2$, making $X = (3, 3, 3, 0, 0, 0)$.\n*   Finally, do the operation with $i = 1, c = -3$, making $X = (0, 0, 0, 0, 0, 0)$.\n\nThus, the first line should contain `Yes`.\nOn the other hand, for the sequence $(A_2, A_3, A_4, A_5, A_6, A_7) = (-1, 1, -2, 2, 0, 5)$, there is no way to make all elements equal $0$, so it is not a good sequence. Thus, the second line should contain `No`."],["20 4\n-19 -66 -99 16 18 33 32 28 26 11 12 0 -16 4 21 21 37 17 55 -19\n5\n13 16\n4 11\n3 12\n13 18\n4 10","No\nYes\nNo\nYes\nNo"]],"created_at":"2026-03-03 11:01:14"}}