#include <bits/stdc++.h>
using namespace std;
struct event {
  int type, pos, x, val;
  event(int a, int b, int c, int d) {
    type = a;
    pos = b;
    x = c;
    val = d;
  }
  void Print() { cout << type << ' ' << pos << ' ' << x << ' ' << val << endl; }
};
bool comp(event A, event B) {
  if (A.pos < B.pos) return true;
  if (B.pos < A.pos) return false;
  if (A.type < B.type) return true;
  if (B.type < A.type) return false;
  if (A.x < B.x) return true;
  return false;
}
void update(int bit[], int n, int x, int val) {
  for (; x < n; x += x & -x) bit[x] += val;
}
int sum(int bit[], int x) {
  int sum = 0;
  for (; x > 0; x -= x & -x) sum += bit[x];
  return sum;
}
int main() {
  int n, m;
  cin >> n >> m;
  int p[n + 1], s[n + 1], b[n + 1], inc[m + 1], pref[m + 1];
  for (int i = 0; i < n; i++) cin >> p[i];
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < n; i++) cin >> b[i];
  vector<event> E;
  for (int i = 0; i < n; i++) {
    E.push_back(event(0, p[i], p[i] + b[i], 1));
    E.push_back(event(1, p[i], b[i] - p[i] + 1, -1));
    E.push_back(event(0, s[i] + 1, p[i] + b[i], -1));
    E.push_back(event(1, s[i] + 1, b[i] - p[i] + 1, 1));
  }
  for (int i = 0; i < m; i++) cin >> inc[i];
  for (int i = 0; i < m; i++) cin >> pref[i];
  map<int, int> mml, mmr;
  for (int i = 0; i < m; i++) {
    E.push_back(event(2, inc[i], pref[i], i));
    mml[inc[i] + pref[i]] = 1;
    mmr[pref[i] - inc[i]] = 1;
  }
  int num = 1;
  for (pair<int, int> x : mml) mml[x.first] = num++;
  num = 1;
  for (pair<int, int> x : mmr) mmr[x.first] = num++;
  sort(E.begin(), E.end(), comp);
  int lsize = mml.size();
  int rsize = mmr.size();
  int *lbit = new int[lsize + 1];
  int *rbit = new int[rsize + 1];
  int *ans = new int[m];
  for (int i = 0; i < lsize + 1; i++) lbit[i] = 0;
  for (int i = 0; i < rsize + 1; i++) rbit[i] = 0;
  for (int i = 0; i < E.size(); i++) {
    event e = E[i];
    if (e.type == 0) {
      auto it = mml.lower_bound(e.x);
      if (it == mml.end()) continue;
      update(lbit, lsize + 1, it->second, e.val);
    } else if (e.type == 1) {
      auto it = mmr.lower_bound(e.x);
      if (it == mmr.end()) continue;
      update(rbit, rsize + 1, it->second, e.val);
    } else {
      int lind = mml[e.x + e.pos];
      int rind = mmr[e.x - e.pos];
      int ind = e.val;
      ans[ind] = sum(lbit, lind) + sum(rbit, rind);
    }
  }
  for (int i = 0; i < m; i++) cout << ans[i] << ' ';
  cout << endl;
}
