B"There are n cells, numbered 1,2, ... , n from left to right. You have to place a robot at any cell initially. The robot must make exactly k moves. In one move, the robot must move one cell to the left or right, provided that it doesn't move out of bounds. In other words, if the robot was in the cell i , it must move to either the cell i-1 or the cell i+1 , as long as it lies between 1 and n (endpoints inclusive). The cells, in the order they are visited (including the cell the robot is placed), together make a good path. Each cell i has a value a_i associated with it. Let c_0, c_1, ... , c_k be the sequence of cells in a good path in the order they are visited ( c_0 is the cell robot is initially placed, c_1 is the cell where the robot is after its first move, and so on; more formally, c_i is the cell that the robot is at after i moves). Then the value of the path is calculated as a_{c_0} + a_{c_1} + ... + a_{c_k} . Your task is to calculate the sum of values over all possible good paths. Since this number can be very large, output it modulo 10^9 + 7 . Two good paths are considered different if the starting cell differs or there exists an integer i in [1, k] such that the current cell of the robot after exactly i moves is different in those paths. You must process q updates to a and print the updated sum each time. Each update changes the value of exactly one cell. See the input format and the sample input-output for more details. The first line of the input contains three space-separated integers n , k and q ( 2 <= n <= 5000 ; 1 <= k <= 5000 ; 1 <= q <= 2 cdot 10^5 ). The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ). q lines follow. Each line contains two space-separated integers i and x ( 1 <= i <= n ; 1 <= "...