CIRCULAR XOR

Given a circular array $A$ with $N$ elements ($A[0]$ , $A[1]$,..,$A[n-1]$), your task is to make the XOR of every $K$-sized circular subarray equal. In one operation you can change any array element to any non negative integer $X$. Note that $X$ can be different for different operations. You need to print the minimum number of operations required. ### Input - The first line contains $T$, the numb