// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const int inf = 1e9;
const ll lim = 1e18;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m;
  cin >> n;
  vi l(5), r(5);
  vvll cs;
  rep(i, 5) {
    cin >> l[i] >> r[i];
    l[i]--;
    r[i]--;
    vll s(r[i] - l[i] + 1, 0);
    rep(j, r[i] - l[i]) {
      ll a;
      cin >> a;
      s[j + 1] = s[j] + a;
    }
    cs.push_back(s);
  }

  cin >> m;
  vvll ss(5);
  rep(_, m) {
    int i;
    ll s;
    cin >> i >> s;
    i--;
    ss[i].push_back(s);
  }
  rep(i, 5) sort(all(ss[i]));

  ll ans = 0;
  rep(j, 5) rep(i, j) {
    int L = max(l[i], l[j]);
    int R = min(r[i], r[j]);
    if (L > R) continue;
    int u = 0, v = 0;
    ll d = cs[j][L - l[j]] - cs[i][L - l[i]];
    ll e = cs[j][R - l[j]] - cs[i][R - l[i]];
    for (ll s : ss[j]) {
      while (u < ss[i].size() && s + d > ss[i][u]) u++;
      while (v < ss[i].size() && s + e >= ss[i][v]) v++;
      ans += v - u;
    }
  }
  cout<<ans<<endl;

  return 0;
}