#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e5 + 5;
int p[MXN];
int s[MXN];
int b[MXN];
int inc[MXN];
int srt[MXN];
int sol[MXN];
int pref[MXN];
array<int, 3> dish[MXN];
array<int, 2> person[MXN];
struct fenwick {
  int ft[MXN];
  void update(int pos, int dx) {
    for (int x = pos + 1; x < MXN; x += x & -x) {
      ft[x] += dx;
    }
  }
  int query(int pos) {
    int ret = 0;
    for (int x = pos + 1; x; x -= x & -x) {
      ret += ft[x];
    }
    return ret;
  }
} fen[2];
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int n, m;
  cin >> n >> m;
  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];
  for (int i = 0; i < m; ++i) cin >> inc[i];
  for (int i = 0; i < m; ++i) cin >> pref[i];
  vector<array<int, 3>> sweep[2];
  for (int i = 0; i < n; ++i) {
    sweep[0].push_back({b[i] + p[i], 0, i});
    sweep[1].push_back({b[i] - p[i], 1, i});
  }
  for (int i = 0; i < m; ++i) {
    sweep[0].push_back({pref[i] + inc[i], 1, i});
    sweep[1].push_back({pref[i] - inc[i], 0, i});
  }
  for (int i = 0; i < m; ++i) {
    srt[i] = inc[i];
  }
  sort(srt, srt + m);
  sort(begin(sweep[0]), end(sweep[0]));
  sort(begin(sweep[1]), end(sweep[1]));
  for (int i = 0; i < n + m; ++i) {
    for (int j = 0; j < 2; ++j) {
      int t = sweep[j][i][1];
      int x = sweep[j][i][2];
      if (t == j) {
        fen[j].update(lower_bound(srt, srt + m, p[x]) - srt, +1);
        fen[j].update(upper_bound(srt, srt + m, s[x]) - srt, -1);
      } else {
        int pos = lower_bound(srt, srt + m, inc[x]) - srt;
        sol[x] += (j ? -1 : 1) * fen[j].query(pos);
      }
    }
  }
  for (int i = 0; i < m; ++i) {
    cout << sol[i] << ' ';
  }
}
