#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <list>
#include <map>
#include <set>
#include <limits>
#include <random>
#include <functional>
#include <unordered_set>
#include <unordered_map>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;

#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>

using namespace std;

const int N = 5010;
const int M = 1010;
const int MOD = 1000000007;
const int INF = 1009000999;
const ll LINF = (1ll << 60) + 1337;
const ld EPS = 0.0000000001;

int add(int x, int y)
{
    x += y;
    while (x >= MOD) x -= MOD;
    while (x < 0) x += MOD;
    return x;
}

int sub(int x, int y)
{
    return add(x, -y);
}

int mul(int x, int y)
{
    return (x * 1ll * y) % MOD;
}

int binpow(int x, int y)
{
    int z = 1;
    while (y > 0)
    {
        if (y % 2 == 1) z = mul(z, x);
        x = mul(x, x);
        y /= 2;
    }
    return z;
}

int inv(int x)
{
    return binpow(x, MOD - 2);
}

int divide(int x, int y)
{
    return mul(x, inv(y));
}

int n, x, q;
int dp[N][N];
int w[N];
int a[N];

int f(int i, int m) {
    if (dp[i][m] != -1) return dp[i][m];
    if (m == 0) return dp[i][m] = 1;
    dp[i][m] = 0;
    if (i - 1 >= 0) dp[i][m] = add(dp[i][m], f(i - 1, m - 1));
    if (i + 1 < n) dp[i][m] = add(dp[i][m], f(i + 1, m - 1));
    return dp[i][m];
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _DEBUG
	freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            dp[i][j] = -1;
        }
    }
    cin >> n >> x >> q;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int sum = 0;
    for (int i = 0; i < n; i++) {
        f(i, x);
    }
    for(int i = 0; i <= x; i++) {
        for (int j = 0; j < n; j++) {
            w[j] = add(w[j], mul(dp[j][i], dp[j][x - i]));
        }
    }
    for (int i = 0; i < n; i++) {
        sum = add(sum, mul(w[i], a[i]));
    }
    while (q--) {
        int i, v;
        cin >> i >> v;
        i--;
        sum = sub(sum, mul(w[i], a[i]));
        a[i] = v;
        sum = add(sum, mul(w[i], a[i]));
        cout << sum << "\n";
    }
}


/*
	Important stuff
	- int overflow
	- array bounds
	- special cases (n=1, max n) maybe adhoc problem
	- doubles are read for a long time (4 * 10 ^ 5 danger GNU vs MS ICPC 2020 1/4)
	- don't get stuck on one approach
	- don't get stuck on one problem
	- recheck submissions if near the end of the tournament and there is nothing to do
	- do something instead of nothing and stay organized
*/