The Fair Nut has two arrays $a$ and $b$, consisting of $n$ numbers. He found them so long ago that no one knows when they came to him.

The Fair Nut often changes numbers in his arrays. He also is interested in how similar $a$ and $b$ are after every modification.

Let's denote similarity of two arrays as the minimum number of operations to apply to make arrays equal (every operation can be applied for both arrays). If it is impossible, similarity will be equal $-1$.

Per one operation you can choose a subarray with length $k$ ($k$ is fixed), and change every element $a_i$, which belongs to the chosen subarray, to $a_i \oplus x$ ($x$ can be chosen), where $\oplus$ denotes the bitwise XOR operation.

Nut has already calculated the similarity of the arrays after every modification. Can you do it?

Note that you just need to calculate those values, that is you do not need to apply any operations.

The first line contains three numbers $n$, $k$ and $q$ ($1 \le k \le n \le 2 \cdot 10^5$, $0 \le q \le 2 \cdot 10^5$) — the length of the arrays, the length of the subarrays, to which the operations are applied, and the number of queries.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \le a_i < 2^{14}$) — elements of array $a$.

The third line contains $n$ integers $b_1, b_2, \ldots, b_n$ ($0 \le b_i < 2^{14}$) — elements of array $b$.

Each of the next $q$ lines describes query and contains string $s$ and two integers $p$ and $v$ ($1 \le p \le n$, $0 \le v < 2^{14}$) — array, which this query changes («a» or «b» without quotes), index of changing element and its new value.

On the first line print initial similarity of arrays $a$ and $b$.

On the $i$-th of following $q$ lines print similarity of $a$ and $b$ after applying first $i$ modifications.