Hououin Kyouma and Xorsack

Hououin Kyouma built a time machine and went to future to a time where P = NP is proved. But, as the world lines are separated, in the new world line, people don't add numbers the way we do. They take bitwise xor to add numbers In that world, can you solve the subset sum problem ? Given N numbers and K, find out if there exists a subset of numbers such that their bitwise xor is K. Input First