#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,1,0,-1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } ll n,m; vl p; vector> mp(800); ll calc(vpl v,vpl to){ rep(i,800)mp[i].clear(); rep(i,n){ rep(j,m){ pl q={v[i].first-to[j].first,v[i].second-to[j].second}; ll x=((q.first%800)+800)%800; mp[x][q]+=p[i]; } } ll ans=0; for(auto q:mp){ for(auto t:q){ chmax(ans,t.second); } } return ans; } int main(){ cin >> n >> m; p.resize(n); rep(i,n)cin >> p[i]; vpl a(n),b(m); rep(i,n){ ll x,y;cin >> x >> y;a[i]={x,y}; } rep(i,m){ ll x,y;cin >> x >> y;b[i]={x,y}; } ll ans=0; chmax(ans,calc(a,b)); rep(i,n)a[i].first*=-1; chmax(ans,calc(a,b)); rep(i,n)a[i].second*=-1; chmax(ans,calc(a,b)); rep(i,n)a[i].first*=-1; chmax(ans,calc(a,b)); cout << ans << endl; }