CF1139F.Dish Shopping

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 \leq inc_j \leq s_i$.

Also, a person $j$ can buy a dish $i$, only if $|b_i-pref_j| \leq (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.

城市中有 $m$ 个人，有 $n$ 种菜肴在该城市出售。每种菜肴 $i$ 具有一个价格 $p_i$、一个标准值 $s_i$ 和一个美观度 $b_i$。每个人 $j$ 的收入为 $inc_j$，偏好的美观度为 $pref_j$。

一个人绝不会购买标准值小于其收入的菜肴；同时，一个人也无法负担价格超过其收入的菜肴。换言之，人 $j$ 只有在满足 $p_i \leq inc_j \leq s_i$ 时，才能购买菜肴 $i$。

此外，人 $j$ 只有在满足 $|b_i - pref_j| \leq (inc_j - p_i)$ 时，才能购买菜肴 $i$。也就是说，若菜肴价格比该人的收入低 $k$，则此人仅允许菜肴美观度与其偏好美观度之间的绝对差值至多为 $k$。

请输出城市中每个人所能购买的菜肴数量。

The first line contains two integers $n$ and $m$ ($1 \leq n \leq 10^5$, $1 \leq m \leq 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 \leq p_i \leq 10^9$), the price of each dish.

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

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

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

The sixth line contains $m$ integers $pref_j$ ($1 \leq pref_j \leq 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 \leq s_i$.

第一行包含两个整数 $n$ 和 $m$（$1 \leq n \leq 10^5$，$1 \leq m \leq 10^5$），分别表示该城市中可提供的菜肴数量以及该城市中居住的人数。

第二行包含 $n$ 个整数 $p_i$（$1 \leq p_i \leq 10^9$），表示每道菜肴的价格。

第三行包含 $n$ 个整数 $s_i$（$1 \leq s_i \leq 10^9$），表示每道菜肴的标准。

第四行包含 $n$ 个整数 $b_i$（$1 \leq b_i \leq 10^9$），表示每道菜肴的美观度。

第五行包含 $m$ 个整数 $inc_j$（$1 \leq inc_j \leq 10^9$），表示每个人的收入。

第六行包含 $m$ 个整数 $pref_j$（$1 \leq pref_j \leq 10^9$），表示每个人偏好的美观度。

保证对所有从 $1$ 到 $n$ 的整数 $i$，均满足条件：$p_i \leq s_i$。

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

输出 $m$ 个整数，表示城市中每个人能够购买的菜肴数量。

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$.

在第一个例子中，第一个人可以购买菜品 $2$，第二个人可以购买菜品 $1$ 和 $2$，第三个人无法购买任何菜品。

在第二个例子中，第一个人无法购买任何菜品，第二个人可以购买菜品 $1$ 和 $4$，第三个人可以购买菜品 $1$、$2$ 和 $4$。