#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef priority_queue<pl, vector<pl>, greater<pl> > pq;

template<class T, class S>
ostream& operator<<(ostream &o, pair<T, S> p) {
    return o<<'('<<p.first<<", "<<p.second<<')';
}

template<template<class, class...> class T, class... A>
typename enable_if<!is_same<T<A...>, string>(), ostream&>::type
operator<<(ostream &o, T<A...> V) {
	o<<'[';
	for(auto a:V) o<<a<<", ";
	return o<<']';
}

// This is tuples, _p is helper
template<ll i, class... T>
typename enable_if<i==sizeof...(T)>::type _p(ostream& o, tuple<T...> t) {}

template<ll i, class... T>
typename enable_if<i<sizeof...(T)>::type _p(ostream& o, tuple<T...> t) {
    _p<i+1>(o << get<i>(t)<< ", ", t);
}
 
template<class... T>
ostream& operator<<(ostream& o, tuple<T...> t) {
    _p<0>(o<<'(', t);
    return o<<')';
}


#define G(x) ll x; cin >> x;
#define Gs(s) string s; cin >> s;
#define Gd(x) ld x; cin >> x;
#define F(i, l, r) for(ll i = l; i < (r); i++)
#define F1(i, l, r) for(ll i = l; i >= (r); i--)
#define Fi(i, s) for(auto i = (s).begin(); i != (s).end(); i++)
#define L G(_t) F(_t1, 0, _t)
#define H(ar, n) vector<ll> ar(n); F(_i, 0, n) cin >> ar[_i];
#define A first
#define B second
#define PA(ar, n) F(_i, 0, n) cout << (ar)[_i] << " "; cout << endl; 
#define PB push_back
#define V vector
#define CASE cout << "Case #" << _t1 + 1 << ": " 
#define CC << " " <<
#define BE(ar) ar.begin(), ar.end()
#define CO(x) cout << (x) << endl;
#define D(x) ((x) - '0')
#define EX(x) {cout << (x) << endl; return 0;}
#define S(ar, val) memset(ar, val, sizeof(ar));
ll M = 1000000007; //998244353;
ll inv(ll a, ll b){return 1<a ? b - inv(b%a,a)*b/a : 1;}
ll gcd(ll x, ll y){if(y == 0) return x; return gcd(y, x % y); }
pl neigh[4] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};

#define N 5010

ll n, dp[N][N], used[N][N];

#define DP dp[i][j]
ll r(ll i, ll j){
	if(j < 0) return 0;
	if(j >= n) return 0;
	if(~DP) return DP;
	if(i == 0) return DP = 1;
	return DP = (r(i-1, j-1) + r(i-1, j+1)) % M;
}

int main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);
	cin >> n; G(k) G(q)
	H(a, n)
	S(dp, -1)
	F(i, 0, n) r(k, i);
	F(i, 0, n) used[k][i] = 1;
	F1(i, k, 1){
		F(j, 0, n){
			if(j > 0) used[i-1][j-1] = (used[i-1][j-1] + used[i][j]) % M;
			if(j < n - 1) used[i-1][j+1] = (used[i-1][j+1] + used[i][j]) % M;
		}
	}
	ll res[n];
	S(res, 0);
	ll sum = 0;
	F(i, 0, n){
		F(j, 0, k+1) res[i] = (res[i] + used[j][i] * dp[j][i] % M) %M;
		sum = (sum+res[i] * a[i])%M;
	}
	F(i, 0, q){
		G(ind) G(ai)
		sum = ((sum - res[ind-1] * a[ind-1]) % M + M) % M;
		sum = (sum + res[ind-1] * ai % M) % M;
		a[ind-1] = ai;
		cout << sum << endl;
	}
}
