CF691E Xor-sequences

You are given $ n $ integers $ a_{1},a_{2},...,a_{n} $ . A sequence of integers $ x_{1},x_{2},...,x_{k} $ is called a "xor-sequence" if for every $ 1

The first line contains two integers $ n $ and $ k $ ( $ 1

Print the only integer $ c $ — the number of "xor-sequences" of length $ k $ modulo $ 10^{9}+7 $ .