XOR-ed Palindromes

In this problem, we are working with binary strings with length $K$. A binary string contains only characters '0' and '1'. The bitwise XOR of two such strings $X$ and $Y$ (denoted by $X \oplus Y$) is also a binary string with length $K$. You have a sequence $A$ of binary strings, indexed from $1$. Initially, it is empty. You should process $Q$ queries. In each query: - You are given two int