J - Recursion

Let $n$ be a non-negative integer power of $2$. We define a recurrence relation as follows: $$ f_n(x) = \begin{cases} 1, & \text{if } 1 \le x \le n, \\ \bigl(f_n(x-1) + f_n(x-n)\bigr) \bmod 2, & \text{if } x > n. \end{cases} $$ Given $n$ and $m$, find $f_n(m)$. ### Input - The first line of input will contain a single integer $t$, denoting the number of test cases. - Each test case consists o