Problem: There are m people living in a city. There are n dishes sold in the city. Each dish i has a price p_i, a standard s_i and a beauty b_i. Each person j has an income of inc_j and a preferred beauty pref_j. 

A person would never buy a dish whose standard is less than the person's income. Also, a person can't afford a dish with a price greater than the income of the person. In other words, a person j can buy a dish i only if p_i ≤ inc_j ≤ s_i.

Also, a person j can buy a dish i, only if |b_i-pref_j| ≤ (inc_j-p_i). In other words, if the price of the dish is less than the person's income by k, the person will only allow the absolute difference of at most k between the beauty of the dish and his/her preferred beauty. 

Print the number of dishes that can be bought by each person in the city.

Input

The first line contains two integers n and m (1 ≤ n ≤ 10^5, 1 ≤ m ≤ 10^5), the number of dishes available in the city and the number of people living in the city.

The second line contains n integers p_i (1 ≤ p_i ≤ 10^9), the price of each dish.

The third line contains n integers s_i (1 ≤ s_i ≤ 10^9), the standard of each dish.

The fourth line contains n integers b_i (1 ≤ b_i ≤ 10^9), the beauty of each dish.

The fifth line contains m integers inc_j (1 ≤ inc_j ≤ 10^9), the income of every person.

The sixth line contains m integers pref_j (1 ≤ pref_j ≤ 10^9), the preferred beauty of every person.

It is guaranteed that for all integers i from 1 to n, the following condition holds: p_i ≤ s_i.

Output

Print m integers, the number of dishes that can be bought by every person living in the city.

Examples

Input


3 3
2 1 3
2 4 4
2 1 1
2 2 3
1 2 4


Output


1 2 0 

Input


4 3
1 2 1 1
3 3 1 3
2 1 3 2
1 1 3
1 2 1


Output


0 2 3 

Note

In the first example, the first person can buy dish 2, the second person can buy dishes 1 and 2 and the third person can buy no dishes.

In the second example, the first person can buy no dishes, the second person can buy dishes 1 and 4, and the third person can buy dishes 1, 2 and 4.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const int N = 1e5 + 5, P = 350, Q = 350;
int p[N], s[N], b[N], inc[N], pos[N], pref[N], ans[N], q[N], t[N], tp[N];
int n, m;
multiset<int> st[N];
void upd(int x, int y) {
  t[x] += y;
  tp[x / Q] += y;
}
int que(int x) {
  int y = 0, s = 0;
  while ((y + 1) * Q - 1 <= x) s += tp[y++];
  y *= Q;
  while (y <= x) s += t[y++];
  return s;
}
int x = 0, y = -1, cur = 0;
void handle1(vector<int> &w, int rev) {
  if (w[1] ^ rev) {
    if (w[2] <= y) {
      upd(w[3], 1);
    }
    st[w[2]].insert(w[3]);
  } else {
    if (w[2] <= y) {
      upd(w[3], -1);
    }
    st[w[2]].erase(st[w[2]].find(w[3]));
  }
}
void handle2(vector<int> &w, int rev) {
  if (w[1] ^ rev) {
    if (w[2] >= y) {
      upd(w[3], 1);
    }
    st[w[2]].insert(w[3]);
  } else {
    if (w[2] >= y) {
      upd(w[3], -1);
    }
    st[w[2]].erase(st[w[2]].find(w[3]));
  }
}
void solve1() {
  for (int i = 0; i < N; i++) st[i].clear();
  fill(t, t + N, 0);
  fill(tp, tp + N, 0);
  vector<vector<int>> v;
  vector<int> spb, sb;
  for (int i = 0; i < n; i++) {
    spb.push_back(p[i] - b[i]);
    sb.push_back(b[i]);
  }
  sort(sb.begin(), sb.end());
  sb.erase(unique(sb.begin(), sb.end()), sb.end());
  sort(spb.begin(), spb.end());
  spb.erase(unique(spb.begin(), spb.end()), spb.end());
  for (int i = 0; i < n; i++) {
    int j = lower_bound(sb.begin(), sb.end(), b[i]) - sb.begin(),
        k = lower_bound(spb.begin(), spb.end(), p[i] - b[i]) - spb.begin();
    v.push_back({p[i], 1, j, k});
    v.push_back({s[i] + 1, 0, j, k});
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < m; i++) {
    pos[i] = upper_bound(v.begin(), v.end(), vector<int>{inc[i] + 1, -1}) -
             v.begin();
    q[i] = i;
  }
  sort(q, q + m, [](int x, int y) {
    int px = pos[x] / P;
    if (px == pos[y] / P) {
      if (px & 1) return pref[x] < pref[y];
      return pref[x] > pref[y];
    }
    return pos[x] < pos[y];
  });
  x = 0, y = -1, cur = 0;
  for (int i = 0; i < m; i++) {
    int j = q[i];
    while (x < pos[j]) {
      handle1(v[x], 0);
      x++;
    }
    while (x > pos[j]) {
      x--;
      handle1(v[x], 1);
    }
    while (y < (int)sb.size() - 1 && sb[y + 1] <= pref[j]) {
      y++;
      for (int k : st[y]) upd(k, 1);
    }
    while (y >= 0 && sb[y] > pref[j]) {
      for (int k : st[y]) upd(k, -1);
      y--;
    }
    int k = upper_bound(spb.begin(), spb.end(), inc[j] - pref[j]) - spb.begin();
    ans[j] += que(k - 1);
  }
}
void solve2() {
  for (int i = 0; i < N; i++) st[i].clear();
  fill(t, t + N, 0);
  fill(tp, tp + N, 0);
  vector<vector<int>> v;
  vector<int> spb, sb;
  for (int i = 0; i < n; i++) {
    spb.push_back(p[i] + b[i]);
    sb.push_back(b[i]);
  }
  sort(sb.begin(), sb.end());
  sb.erase(unique(sb.begin(), sb.end()), sb.end());
  sort(spb.begin(), spb.end());
  spb.erase(unique(spb.begin(), spb.end()), spb.end());
  for (int i = 0; i < n; i++) {
    int j = lower_bound(sb.begin(), sb.end(), b[i]) - sb.begin(),
        k = lower_bound(spb.begin(), spb.end(), p[i] + b[i]) - spb.begin();
    v.push_back({p[i], 1, j, k});
    v.push_back({s[i] + 1, 0, j, k});
  }
  sort(v.begin(), v.end());
  x = 0, y = sb.size(), cur = 0;
  for (int i = 0; i < m; i++) {
    int j = q[i];
    while (x < pos[j]) {
      handle2(v[x], 0);
      x++;
    }
    while (x > pos[j]) {
      x--;
      handle2(v[x], 1);
    }
    while (y < sb.size() && sb[y] <= pref[j]) {
      for (int k : st[y]) upd(k, -1);
      y++;
    }
    while (y > 0 && sb[y - 1] > pref[j]) {
      y--;
      for (int k : st[y]) upd(k, 1);
    }
    int k = upper_bound(spb.begin(), spb.end(), inc[j] + pref[j]) - spb.begin();
    ans[j] += que(k - 1);
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  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];
  }
  solve1();
  solve2();
  for (int i = 0; i < m; i++) cout << ans[i] << " ";
  return 0;
}