//#include "bits/stdc++.h"

#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <array>
#include <unordered_map>
#include<unordered_set>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
#include<iomanip>
#include<complex>
#include<fstream>
#include<assert.h>

#include<stdio.h>

using namespace std;

#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)

#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair

//typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, double> pid;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;

template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;

const double EPS = 1e-9;

signed main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, K, Q;
	cin >> N >> K >> Q;

	vector<int> A(N);
	rep(i, 0, N)cin >> A[i];

	vector<vector<int>> WAY(N, vector<int>(K + 1, 0));
	vector<vector<int>> DP(N, vector<int>(K + 1, 0));
	rep(i, 0, N)DP[i][K] = 1;
	rep(i, 0, N)WAY[i][0] = 1;

	rrep(k, 1, K + 1)
	{
		rep(i, 0, N)
		{
			if (0 < i)
			{
				DP[i - 1][k - 1] += DP[i][k];
				DP[i - 1][k - 1] %= MOD;
			}
			if (i < N - 1)
			{
				DP[i + 1][k - 1] += DP[i][k];
				DP[i + 1][k - 1] %= MOD;
			}
		}
	}
	rep(k, 0, K)
	{
		rep(i, 0, N)
		{
			if (0 < i)
			{
				WAY[i - 1][k + 1] += WAY[i][k];
				WAY[i - 1][k + 1] %= MOD;
			}
			if (i < N - 1)
			{
				WAY[i + 1][k + 1] += WAY[i][k];
				WAY[i + 1][k + 1] %= MOD;
			}
		}
	}

	vector<int> CNT(N,0);

	int ans = 0;
	rep(i, 0, N)
	{
		rep(k, 0, K + 1)
		{
			CNT[i] += (DP[i][k] * WAY[i][k]) % MOD;
			CNT[i] %= MOD;
		}
		ans += (CNT[i] * A[i])%MOD;
		ans %= MOD;
	}

	int x, y;
	rep(i, 0, Q)
	{
		cin >> x >> y;
		x--;
		ans = (ans - ((CNT[x] * A[x]) % MOD) + MOD) % MOD;
		A[x] = y;
		ans = (ans + ((CNT[x] * A[x]) % MOD)) % MOD;
		cout << ans << endl;
	}

	return 0;
}