#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    VL l(5), r(5);
    VVL a(5);
    rep(i, 5) {
        cin >> l[i] >> r[i];
        l[i]--, r[i]--;
        int cnt = r[i] - l[i];
        a[i].resize(cnt);
        rep(j, cnt) cin >> a[i][j];
    }
    int m;
    cin >> m;
    VVL train(5);
    rep(_, m) {
        int b, s;
        cin >> b >> s;
        b--;
        train[b].push_back(s);
    }
    rep(i, 5) sort(all(train[i]));
    ll ans = 0;
    rep(j, 5) rep(i, j) {
        int sstop = max(l[i], l[j]), tstop = min(r[i], r[j]);
        if (sstop > tstop) continue;
        VL si = train[i], ti = train[i], sj = train[j], tj = train[j];
        {
            ll acc = 0;
            for(int p = l[i]; p < sstop; ++p) {
                acc += a[i][p - l[i]];
            }
            for(ll& x: si) x += acc;
            for(int p = sstop; p < tstop; ++p) {
                acc += a[i][p - l[i]];
            }
            for(ll& x: ti) x += acc;
        }
        {
            ll acc = 0;
            for(int p = l[j]; p < sstop; ++p) {
                acc += a[j][p - l[j]];
            }
            for(ll& x: sj) x += acc;
            for(int p = sstop; p < tstop; ++p) {
                acc += a[j][p - l[j]];
            }
            for(ll& x: tj) x += acc;
        }
        int x = 0, y = 0;
        rep(k, si.size()) {
            while(x < sj.size() && sj[x] <= si[k]) x++;
            while(y < tj.size() && tj[y] < ti[k]) y++;
            ans += max(0, x - y);
        }
    }
    cout << ans << endl;
}