Problem: 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 ∈ [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.

Input

The first line of the input contains three space-separated integers n, k and q (2 ≤ n ≤ 5000; 1 ≤ k ≤ 5000; 1 ≤ q ≤ 2 ⋅ 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 ≤ x ≤ 10^9) indicating that you must change the value of a_i to x.

Output

Print q integers. The i-th integer should be the sum of values over all good paths after the first i updates are performed. Since the answers may be large, print them modulo 10^9 + 7.

Examples

Input


5 1 5
3 5 1 4 2
1 9
2 4
3 6
4 6
5 2


Output


62
58
78
86
86


Input


5 2 5
3 5 1 4 2
1 9
2 4
3 6
4 6
5 2


Output


157
147
207
227
227


Input


4 40 6
92 21 82 46
3 56
1 72
4 28
1 97
2 49
2 88


Output


239185261
666314041
50729936
516818968
766409450
756910476

Note

In the first example, the good paths are (1, 2), (2, 1), (2, 3), (3, 2), (3, 4), (4, 3), (4, 5), (5, 4).

Initially the values of a are [3, 5, 1, 4, 2]. After the first update, they become [9, 5, 1, 4, 2]. After the second update, they become [9, 4, 1, 4, 2], and so on.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class CFD {
  BufferedReader br;
  PrintWriter out;
  StringTokenizer st;
  boolean eof;
  private static final long MOD = 1000L * 1000L * 1000L + 7;
  private static final int[] dx = {0, -1, 0, 1};
  private static final int[] dy = {1, 0, -1, 0};
  private static final String yes = "Yes";
  private static final String no = "No";

  void solve() {
//    int T = nextInt();
    int T = 1;
    for (int i = 0; i < T; i++) {
      helper();
    }
  }

  void helper() {
    int n = nextInt();
    int k = nextInt();
    int q = nextInt();
    int[] arr = nextIntArr(n);
    long[][] dp = new long[1 + k][n];
    Arrays.fill(dp[0], 1);

    for (int i = 0; i < k; i++) {
      for (int j = 0; j < n; j++) {
        if (j - 1 >= 0) {
          dp[i + 1][j - 1] += dp[i][j];
          if (dp[i + 1][j - 1] >= MOD) {
            dp[i + 1][j - 1] -= MOD;
          }
        }
        if (j + 1 < n) {
          dp[i + 1][j + 1] += dp[i][j];
          if (dp[i + 1][j + 1] >= MOD) {
            dp[i + 1][j + 1] -= MOD;
          }
        }
      }
    }

    long[] coeff = new long[n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= k; j++) {
        coeff[i] += dp[j][i] * dp[k - j][i] % MOD;
        if (coeff[i] >= MOD) {
          coeff[i] -= MOD;
        }
      }
    }
    long res = 0;
    for (int i = 0; i < n; i++) {
      res += arr[i] * coeff[i] % MOD;
      if (res >= MOD) {
        res -= MOD;
      }
    }

    for (int t = 0; t < q; t++) {
      int idx = nextInt() - 1;
      int val = nextInt();
      int prev = arr[idx];
      long diff = (val - prev) * coeff[idx] % MOD;
      if (diff < 0) {
        diff += MOD;
      }
      res += diff;
      res = res % MOD;
      if (res < 0) {
        res += MOD;
      }
      arr[idx] = val;
      outln(res);
    }
  }

  // Power Calculate N^M % MOD, N and M can be long (up to 2^64, ~10^18)
  public long powMod(long N, long M, long MOD){//N^M % MOD
    if(M == 0L)
      return 1L;
    long[] hp = new long[64];
    boolean[] bp = new boolean[64];
    hp[0] = N;
    for(int i = 1; i < hp.length; i++) {
      hp[i] = (hp[i - 1] * hp[i - 1]) % MOD;
    }
    for(int j = 0; j < hp.length; j++) {
      if((M & (1L << j)) != 0)
        bp[j] = true;
    }
    long res = 1;
    for(int i = 0;i < bp.length; i++){
      if(bp[i]) {
        res = (res * hp[i]) % MOD;
      }
    }
    return res;
  }

  void shuffle(int[] a) {
    int n = a.length;
    for(int i = 0; i < n; i++) {
      int r = i + (int) (Math.random() * (n - i));
      int tmp = a[i];
      a[i] = a[r];
      a[r] = tmp;
    }
  }
  long gcd(long a, long b) {
    while(a != 0 && b != 0) {
      long c = b;
      b = a % b;
      a = c;
    }
    return a + b;
  }
  private void outln(Object o) {
    out.println(o);
  }
  private void out(Object o) {
    out.print(o);
  }
  private void formatPrint(double val) {
    outln(String.format("%.9f%n", val));
  }
  public CFD() {
    br = new BufferedReader(new InputStreamReader(System.in));
    out = new PrintWriter(System.out);
    solve();
    out.close();
  }
  public static void main(String[] args) {
    new CFD();
  }

  public long[] nextLongArr(int n) {
    long[] res = new long[n];
    for(int i = 0; i < n; i++)
      res[i] = nextLong();
    return res;
  }
  public int[] nextIntArr(int n) {
    int[] res = new int[n];
    for(int i = 0; i < n; i++)
      res[i] = nextInt();
    return res;
  }
  public String nextToken() {
    while (st == null || !st.hasMoreTokens()) {
      try {
        st = new StringTokenizer(br.readLine());
      } catch (Exception e) {
        eof = true;
        return null;
      }
    }
    return st.nextToken();
  }
  public String nextString() {
    try {
      return br.readLine();
    } catch (IOException e) {
      eof = true;
      return null;
    }
  }
  public int nextInt() {
    return Integer.parseInt(nextToken());
  }
  public long nextLong() {
    return Long.parseLong(nextToken());
  }
  public double nextDouble() {
    return Double.parseDouble(nextToken());
  }
}