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 mm taxi drivers in the city, who every day transport the rest of the city residents — nnriders.

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 ii the number aiai — the number of riders that would call the ii-th taxi driver when all drivers and riders are at their home?

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

The first line contains two integers nn and mm (1≤n,m≤1051≤n,m≤105) — number of riders and taxi drivers.

The second line contains n+mn+m integers x1,x2,…,xn+mx1,x2,…,xn+m (1≤x1<x2<…<xn+m≤1091≤x1<x2<…<xn+m≤109), where xixi is the coordinate where the ii-th resident lives.

The third line contains n+mn+m integers t1,t2,…,tn+mt1,t2,…,tn+m (0≤ti≤10≤ti≤1). If ti=1ti=1, then the ii-th resident is a taxi driver, otherwise ti=0ti=0.

It is guaranteed that the number of ii such that ti=1ti=1 is equal to mm.

Print mm integers a1,a2,…,ama1,a2,…,am, where aiai is the answer for the ii-th taxi driver. The taxi driver has the number ii if among all the taxi drivers he lives in the ii-th smallest coordinate (see examples for better understanding).

#include <bits/stdc++.h>

using namespace std;

const int maxn = 300010;

int n, m;

long long pos[maxn], dir[maxn];

int cnt1 = 0, cnt = 0;

struct Node{

    long long dis;

    long long num;

}car[maxn];

int main() {

    scanf("%d%d", &n, &m);

    for(int i = 1; i <= m + n; i ++)

        cin >> pos[i];

    for(int i = 1; i <= n + m; i ++) {

        cin >> dir[i];

        if(dir[i] == 1) {

            cnt1 ++;

            car[cnt1].dis = pos[i];

        }

    }

    for(int i = 1; i <= n + m; i ++) {

        if(m == 1) {

            printf("%d\n", n + m - 1);

            return 0;

        }

        if(pos[i] < car[1].dis)

            car[1].num ++;

        else if(pos[i] > car[cnt1].dis)

            car[cnt1].num = car[cnt1].num + 1;

        else if(dir[i] == 1)

            cnt ++;

        else if(pos[i] * 2 > car[cnt].dis + car[cnt + 1].dis)

            car[cnt + 1].num ++;

        else car[cnt].num ++;

    }

    for(int i = 1; i <= cnt1; i ++) {

        cout << car[i].num;

        printf("%s", i != cnt1 ? " " : "\n");

    }

    return 0;

}