## Bitwise Convolution 4, 5

Points: 25 (partial)
Time limit: 1.0s
Memory limit: 512M

Author:
Problem type
##### Bitwise Convolution Exercise 4, 5
1. Exercise 1: Bitwise XOR convolution

2. Exercise 2: Bitwise OR convolution

3. Exercise 3: Bitwise AND convolution

4. Exercise 4: An operation that ORs the first bit, ANDs the second bit, and then repeats.

5. Exercise 5: An operation that ORs the first bit, ANDs the second bit, XORs the third one, and then repeats.

6. Exercise 6: XOR in base 3 (addition with no carry).

#### Input and Output Specification

The first line contains the integers () and (), the exercise number and the length of the vectors and . The next line will contain and the line after will contain .

You will ouput the vector up until the last non-zero entry, where is the convolution operation of the respective subtask. Please output these numbers modulo .

#### Sample Input 1

4 4
1 2 1 2
1 2 3 4

#### Sample Output 1

5 34 3 18

#### Explanation

We are given that . Let denote the convolution operation.

We already see from above that

#### Sample Input 2

5 2
0 0
0 0