CF1075B.Taxi drivers and Lyft

Palo Alto is an unusual city because it is an endless coordinate line. It is also known for the office of Lyft Level 5.

Lyft has become so popular so that it is now used by all $m$ taxi drivers in the city, who every day transport the rest of the city residents — $n$ riders.

Each resident (including taxi drivers) of Palo-Alto lives in its unique location (there is no such pair of residents that their coordinates are the same).

The Lyft system is very clever: when a rider calls a taxi, his call does not go to all taxi drivers, but only to the one that is the closest to that person. If there are multiple ones with the same distance, then to taxi driver with a smaller coordinate is selected.

But one morning the taxi drivers wondered: how many riders are there that would call the given taxi driver if they were the first to order a taxi on that day? In other words, you need to find for each taxi driver $i$ the number $a_{i}$ — the number of riders that would call the $i$-th taxi driver when all drivers and riders are at their home?

The taxi driver can neither transport himself nor other taxi drivers.

帕洛阿尔托是一座不寻常的城市，因为它是一条无限延伸的数轴。这座城市还以 Lyft Level 5 办公室而闻名。

Lyft 如此受欢迎，以至于如今城市中全部 $m$ 名出租车司机每天都使用它来运送其余的 $n$ 名乘客。

每位居民（包括出租车司机）都居住在帕洛阿尔托独一无二的位置上（不存在任意两位居民坐标相同的情况）。

Lyft 系统非常智能：当一名乘客呼叫出租车时，该呼叫并不会发送给所有出租车司机，而只会发送给距离该乘客最近的一位司机。若存在多名司机与该乘客距离相同，则选择坐标更小的那位司机。

但某天清晨，出租车司机们忽然好奇：如果当天第一位叫车的乘客恰好是某位特定乘客，那么会有多少名乘客会呼叫这位特定的出租车司机？换言之，你需要对每位出租车司机 $i$，求出数值 $a_{i}$ —— 即当所有司机和乘客均位于各自住所时，会呼叫第 $i$ 位出租车司机的乘客人数。

出租车司机既不能运送自己，也不能运送其他出租车司机。

The first line contains two integers $n$ and $m$ ($1 \le n,m \le 10^5$) — number of riders and taxi drivers.

The second line contains $n + m$ integers $x_1, x_2, \ldots, x_{n+m}$ ($1 \le x_1 \lt x_2 \lt \ldots \lt x_{n+m} \le 10^9$), where $x_i$ is the coordinate where the $i$-th resident lives.

The third line contains $n + m$ integers $t_1, t_2, \ldots, t_{n+m}$ ($0 \le t_i \le 1$). If $t_i = 1$, then the $i$-th resident is a taxi driver, otherwise $t_i = 0$.

It is guaranteed that the number of $i$ such that $t_i = 1$ is equal to $m$.

第一行包含两个整数 $n$ 和 $m$（$1 \le n,m \le 10^5$），分别表示乘客人数和出租车司机人数。

第二行包含 $n + m$ 个整数 $x_1, x_2, \ldots, x_{n+m}$（$1 \le x_1 \lt x_2 \lt \ldots \lt x_{n+m} \le 10^9$），其中 $x_i$ 表示第 $i$ 位居民的居住坐标。

第三行包含 $n + m$ 个整数 $t_1, t_2, \ldots, t_{n+m}$（$0 \le t_i \le 1$）。若 $t_i = 1$，则第 $i$ 位居民是出租车司机；否则 $t_i = 0$。

保证满足 $t_i = 1$ 的 $i$ 的个数恰好为 $m$。

Print $m$ integers $a_1, a_2, \ldots, a_{m}$, where $a_i$ is the answer for the $i$-th taxi driver. The taxi driver has the number $i$ if among all the taxi drivers he lives in the $i$-th smallest coordinate (see examples for better understanding).

输出 $m$ 个整数 $a_1, a_2, \ldots, a_{m}$，其中 $a_i$ 表示第 $i$ 位出租车司机的答案。若所有出租车司机按其居住坐标从小到大排序后，某位司机位于第 $i$ 小的位置，则该司机编号为 $i$（参见示例以更好地理解）。

In the first example, we have only one taxi driver, which means an order from any of $n$ riders will go to him.

In the second example, the first taxi driver lives at the point with the coordinate $2$, and the second one lives at the point with the coordinate $6$. Obviously, the nearest taxi driver to the rider who lives on the $3$ coordinate is the first one, and to the rider who lives on the coordinate $5$ is the second one. The rider who lives on the $4$ coordinate has the same distance to the first and the second taxi drivers, but since the first taxi driver has a smaller coordinate, the call from this rider will go to the first taxi driver.

In the third example, we have one rider and the taxi driver nearest to him is the fourth one.

在第一个例子中，我们只有一名出租车司机，这意味着任意一名 $n$ 名乘客的订单都会分配给他。

在第二个例子中，第一名出租车司机住在坐标为 $2$ 的位置，第二名出租车司机住在坐标为 $6$ 的位置。显然，住在坐标 $3$ 的乘客距离第一名司机最近，而住在坐标 $5$ 的乘客距离第二名司机最近。住在坐标 $4$ 的乘客到第一名和第二名司机的距离相等，但由于第一名司机的坐标更小，因此该乘客的呼叫将分配给第一名司机。

在第三个例子中，我们只有一名乘客，离他最近的出租车司机是第四名。