#include <bits/stdc++.h>
using namespace std;
const int mod =  1000000007;
const int LIM = 100005;
#define int long long
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin() , a.end()
#define pii pair<int,int>
#define vi vector<int>
#define endl '\n'
#define pb push_back
#define sp <<" "<<
#define ss second
#define ff firsto
int power(int x, int n, int m=mod){
    int res = 1;
    while(n){
          if(n&1){
                res = res * x % m;
          }
          x = x * x % m;
          n>>=1;
    }
    return (res%m);
}
/*bool prime[1000006];
void sieve(int n)
{
      memset(prime, true, sizeof(prime));
      int rootn = (int)sqrt(n);
      for (int p = 2; p <= rootn; p++)
            if(prime[p] == true)
                  for(int i = p*p; i <= n; i += p)
                        prime[i] = false;
      prime[1] = 0;

}*/
/*
int fac[100005];
int ncr(int n,int r)
{
      return fac[n]*((power(fac[n-r], mod-2)*power(fac[r], mod-2))%mod)%mod;
}
*/

int32_t main()
{
  IOS;
  int tt=1,n,k,x,y,z,i,j;
  //cin>>tt;
  while(tt--){
    int q;
    cin >> n >> k >> q;
    int a[n];
    for(int i=0;i<n;i++) cin >> a[i];
    int dp[n+1][k+1];
    for(int i=0; i<=n; i++)
    for(int j=0; j<=k; j++)
    dp[i][j]=0;
    for(int i=0;i<n;i++)
        dp[i][0] = 1;
    for(int i=1;i<=k;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(j)
            {
                dp[j][i] = (dp[j][i] + dp[j-1][i-1])%mod;
            }
            if(j != n-1)
            {
                dp[j][i] = (dp[j][i] + dp[j+1][i-1])%mod;
            }
        }
    }
    int res = 0;
    int cff[n+1];
    for(int i=0;i<n;i++)
    {
      cff[i]=0;
        for(int j=0;j<=k;j++)
        {
            cff[i] = (cff[i] + dp[i][j]*dp[i][k-j]%mod)%mod;
        }
        res = (res + a[i]*cff[i]%mod)%mod;
    }
    while(q--)
    {
        cin >> i >> x;
        i--;
        res = (res - (a[i]*cff[i])%mod + mod)%mod;
        a[i] = x;
        res = (res + a[i]*cff[i]%mod)%mod;
        cout << res <<endl;
    }

}
}
