Machine and Queue

Chef has a magic machine in which an integer $M$ is stored. She also has a queue $A$ of $N$ integers. She wants to send all the integers of the queue $A$ one by one to the magic machine. The magic machine will destroy an integer $p$ if the $bitwise$ AND of $M$ and $p$ is equal to $M$. If the machine cannot destroy the integer it will change any 1 bit of the integer i.e, if it is 0 it will make it