#include <bits/stdc++.h>
using namespace std;
int main() {
  long long N;
  scanf("%lld", &N);
  vector<long long> a;
  for (long long n = 0; n < N; ++n) {
    long long x;
    scanf("%lld", &x);
    a.push_back(x);
  }
  long long Q;
  scanf("%lld", &Q);
  while (Q--) {
    long long x, y;
    scanf("%lld", &x);
    scanf("%lld", &y);
    --x;
    long long Left = y - 1;
    long long Right = a[x] - y;
    if (x - 1 >= 0) {
      a[x - 1] += Left;
    }
    if (x + 1 < N) {
      a[x + 1] += Right;
    }
    a[x] = 0;
  }
  for (int n = 0; n < N; ++n) {
    cout << a[n] << endl;
  }
  return 0;
}
