Question

You are given three integers N, M and X. You want to calculate the number of arrays A of size N, that satisfy the following conditions:

• The sum of elements of the array is equal to M, i. e A1 + A2 + A3 + .. +

AN = M

• The bitwise xor of the elements of the array is equal to X, ie A₁ ^ A2^ A3^..^ AN X. Here^ denotes bitwise xor operation.

A

Since the answer can be very large return it modulo 10º + 7.​

Answer 1

Answer:

good morning good question