#include<bits/stdc++.h>
using namespace std;

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

void solve(){
    ll n,m;cin>>n>>m;
    vector<ll>p(n);
    rep(i,n)cin>>p[i];
    vector<ll>a(n),b(n),c(m),d(m);
    rep(i,n)cin>>a[i]>>b[i];
    rep(i,m)cin>>c[i]>>d[i];
    ll z=1,w=1;
    ll ans=0;
    ll zz=INF*4;
    ll zzz=INF*2;
    rep(x,2){
        z*=(-1);
        rep(i,n)a[i]*=z;
        rep(y,2){
            w*=(-1);
            rep(j,n)b[j]*=w;
            map<ll,ll>ma;
            rep(i,n){
                ll pi=p[i];
                ll ai=a[i],bi=b[i];
                rep(j,m){
                    ma[(c[j]-ai+zzz)*zz+d[j]-bi+zzz]+=pi;
                }
            }
            for(auto e:ma)ans=max(ans,e.se);
            rep(j,n)b[j]*=w;
        }
        rep(i,n)a[i]*=z;
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}