Monocarp has (n) pizzas, the (i)-th pizza consists of (a_i) slices. Pizzas are denoted by uppercase Latin letters from A to the (n)-th letter of the Latin alphabet. Monocarp also has (m) friends, and he wants to invite exactly two of them to eat pizza. For each friend, Monocarp knows which pizzas that friend likes. After the friends arrive at Monocarp's house, for each pizza, the following happens: if the pizza is not liked by any of the two invited friends, Monocarp eats it; if the pizza is liked by exactly one of the two invited friends, that friend eats it; and if the pizza is liked by both friends, they try to split it. If it consists of an even number of slices, they both eat exactly half of the slices. But if the pizza consists of an odd number of slices, they start quarrelling, trying to decide who will eat an extra slice — and Monocarp doesn't like that. For each (k) from (0) to (\sum a_i), calculate the number of ways to choose exactly two friends to invite so that the friends don't quarrel, and Monocarp eats exactly (k) slices. The first line contains two integers (n) and (m) ((1 \le n \le 20); (2 \le m \le 5 \cdot 10^5)) — the number of pizzas and the number of friends, respectively. The second line contains (m) strings (s_1, s_2, \dots, s_m) ((1 \le |s_i| \le n)), where (s_i) is a string consisting of distinct characters from A to the (n)-th letter of the Latin alphabet, denoting which pizzas the (i)-th friend likes. In every string (s_i), the characters are sorted in lexicographical (alphabetic) order. The third line contains (n) integers (a_1, a_2, \dots, a_n) ((1 \le a_i \le 2 \cdot 10^4)) — the sizes of the pizzas. Print (\sum a_i + 1) integers, where the (k)-th integer (starting from (0)) should be the number of ways to choose exactly two friends to invite so that the friends don't quarrel, and Monocarp eats exactly (k) slices. Let's