#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 4e18;
const int inf = 2e9;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int a[105];
int main(void) {
  int i, n;
  scanf("%d", &n);
  for (i = 0; i < n; ++i) scanf("%d", a + i);
  int m;
  scanf("%d", &m);
  while (m--) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--;
    if (x) a[x - 1] += y - 1;
    a[x + 1] += a[x] - y;
    a[x] = 0;
  }
  for (i = 0; i < n; ++i) printf("%d\n", a[i]);
  return 0;
}
