#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
int L[5],R[5];
LL A[5][100000];
int Q;
vector<int> S[5];

int main(){
  int N; scanf("%d",&N);
  rep(k,5){
    scanf("%d%d",&L[k],&R[k]); L[k]--; R[k]--;
    rep(i,N) A[k][i]=0; for(int i=L[k]+1; i<=R[k]; i++){ int a; scanf("%d",&a); A[k][i]=A[k][i-1]+a; }
  }

  scanf("%d",&Q);
  rep(i,Q){ int b,s; scanf("%d%d",&b,&s); b--; S[b].push_back(s); }
  rep(k,5) sort(S[k].begin(),S[k].end());

  LL ans=0;
  rep(k2,5) rep(k1,k2){
    LL maxL=max(L[k1],L[k2]), minR=min(R[k1],R[k2]);
    if(minR<maxL) continue;
    // S[k1]-S[k2]
    LL l=A[k2][maxL]-A[k1][maxL],r=A[k2][minR]-A[k1][minR];
    int lp=0,rp=0;
    for(int s:S[k1]){
      while(lp<S[k2].size()) if(s-S[k2][lp]>=l) lp++; else break;
      while(rp<S[k2].size()) if(s-S[k2][rp]>r) rp++; else break;
      ans+=lp-rp;
    }
  }

  printf("%lld\n",ans);

  return 0;
}