package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

type FastScanner struct {
	r *bufio.Reader
}

func NewFastScanner() *FastScanner {
	return &FastScanner{r: bufio.NewReaderSize(os.Stdin, 1<<20)}
}

func (fs *FastScanner) NextInt() int {
	sign, val := 1, 0
	c, err := fs.r.ReadByte()
	for (c < '0' || c > '9') && c != '-' {
		c, err = fs.r.ReadByte()
		if err != nil {
			return 0
		}
	}
	if c == '-' {
		sign = -1
		c, _ = fs.r.ReadByte()
	}
	for c >= '0' && c <= '9' {
		val = val*10 + int(c-'0')
		c, err = fs.r.ReadByte()
		if err != nil {
			break
		}
	}
	if err == nil {
		_ = fs.r.UnreadByte()
	}
	return sign * val
}

func main() {
	fs := NewFastScanner()
	n := fs.NextInt()
	m := fs.NextInt()
	k := n + m

	x := make([]int, k)
	for i := 0; i < k; i++ {
		x[i] = fs.NextInt()
	}

	t := make([]int, k)
	taxiPos := make([]int, 0, m)
	for i := 0; i < k; i++ {
		t[i] = fs.NextInt()
		if t[i] == 1 {
			taxiPos = append(taxiPos, x[i])
		}
	}

	ans := make([]int, m)

	for i := 0; i < k; i++ {
		if t[i] == 0 {
			pos := x[i]
			j := sort.SearchInts(taxiPos, pos)
			if j == 0 {
				ans[0]++
			} else if j == m {
				ans[m-1]++
			} else {
				if pos-taxiPos[j-1] <= taxiPos[j]-pos {
					ans[j-1]++
				} else {
					ans[j]++
				}
			}
		}
	}

	w := bufio.NewWriterSize(os.Stdout, 1<<20)
	for i := 0; i < m; i++ {
		if i > 0 {
			fmt.Fprint(w, " ")
		}
		fmt.Fprint(w, ans[i])
	}
	fmt.Fprintln(w)
	w.Flush()
}