#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  int a[n];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int m;
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x == 1) {
      a[x] += max((a[x - 1] - y), 0);
      a[x - 1] = 0;
    } else if (x == n) {
      a[x - 2] += y - 1;
      a[x - 1] = 0;
    } else {
      a[x - 2] += y - 1;
      a[x] += max((a[x - 1] - y), 0);
      a[x - 1] = 0;
    }
  }
  for (int i = 0; i < n; i++) printf("%d\n", a[i]);
}
