#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int n, m;
struct Node {
  long long x;
  int id;
  int flag;
  Node() {}
  Node(int x, int id, int flag) : x(x), id(id), flag(flag) {}
};
const int maxn = 1e5 + 10;
vector<Node> ft;
vector<long long> st;
map<long long, int> idx;
long long sum1[500010], sum2[500010];
int get_idx(long long t) { return idx[t]; }
void add1(long long t, int flag) {
  for (; t <= 4 * maxn; t += t & -t) {
    sum1[t] += flag;
  }
}
void add2(long long t, int flag) {
  for (; t <= 4 * maxn; t += t & -t) {
    sum2[t] += flag;
  }
}
int get1(long long t) {
  int ret = 0;
  while (t > 0) {
    ret += sum1[t];
    t -= t & -t;
  }
  return ret;
}
int get2(long long t) {
  int ret = 0;
  while (t > 0) {
    ret += sum2[t];
    t -= t & -t;
  }
  return ret;
}
int p[100010], s[100010], b[100010], inc[100010], pre[100010];
int ans[100010];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) scanf("%d", &p[i]);
  for (int i = 0; i < n; ++i) scanf("%d", &s[i]);
  for (int i = 0; i < n; ++i) scanf("%d", &b[i]);
  for (int i = 0; i < m; ++i) scanf("%d", &inc[i]);
  for (int i = 0; i < m; ++i) scanf("%d", &pre[i]);
  for (int i = 0; i < n; ++i) {
    ft.push_back(Node(p[i], i, 0));
    ft.push_back(Node(s[i], i, 2));
    st.push_back(b[i] + p[i]);
    st.push_back(b[i] - p[i] + 1);
  }
  for (int i = 0; i < m; ++i) {
    ft.push_back(Node(inc[i], i, 1));
    st.push_back(pre[i] - inc[i]);
    st.push_back(inc[i] + pre[i]);
  }
  auto cmp = [&](const Node &a, const Node &b) {
    return a.x < b.x || (a.x == b.x && a.flag < b.flag);
  };
  sort(ft.begin(), ft.end(), cmp);
  sort(st.begin(), st.end());
  int pos = unique(st.begin(), st.end()) - st.begin();
  for (int i = 0; i < pos; ++i) {
    idx[st[i]] = i + 1;
  }
  memset(sum1, 0, sizeof(sum1));
  memset(sum2, 0, sizeof(sum2));
  for (int i = 0; i < ft.size(); ++i) {
    Node node = ft[i];
    int id = node.id;
    int flag = node.flag;
    if (flag == 0) {
      add1(get_idx(b[id] + p[id]), 1);
      add2(get_idx(b[id] - p[id] + 1), -1);
    } else if (flag == 2) {
      add1(get_idx(b[id] + p[id]), -1);
      add2(get_idx(b[id] - p[id] + 1), 1);
    } else {
      ans[id] =
          get1(get_idx(inc[id] + pre[id])) + get2(get_idx(pre[id] - inc[id]));
      if (ans[id] < 0) ans[id] = -ans[id];
    }
  }
  for (int i = 0; i < m; ++i) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
