CF177D1 Encrypting Messages

The Smart Beaver from ABBYY invented a new message encryption method and now wants to check its performance. Checking it manually is long and tiresome, so he decided to ask the ABBYY Cup contestants for help. A message is a sequence of $ n $ integers $ a_{1},a_{2},...,a_{n} $ . Encryption uses a key which is a sequence of $ m $ integers $ b_{1},b_{2},...,b_{m} $ ( $ m

The first input line contains three integers $ n $ , $ m $ and $ c $ , separated by single spaces. The second input line contains $ n $ integers $ a_{i} $ ( $ 0

Print $ n $ space-separated integers — the result of encrypting the original message.

In the first sample the encryption is performed in two steps: after the first step $ a=(0,0,0,1) $ (remember that the calculations are performed modulo 2), after the second step $ a=(0,1,1,0) $ , and that is the answer.