Problem: 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 ⊕ x (x can be chosen), where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). 

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.

Input

The first line contains three numbers n, k and q (1 ≤ k ≤ n ≤ 2 ⋅ 10^5, 0 ≤ q ≤ 2 ⋅ 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, …, a_n (0 ≤ a_i < 2^{14}) — elements of array a.

The third line contains n integers b_1, b_2, …, b_n (0 ≤ 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 ≤ p ≤ n, 0 ≤ v < 2^{14}) — array, which this query changes («a» or «b» without quotes), index of changing element and its new value.

Output

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.

Examples

Input

3 3 1
0 4 2
1 2 3
b 2 5


Output

-1
1


Input

3 2 2
1 3 2
0 0 0
a 1 0
b 1 1


Output

2
-1
2

Note

In the first sample making arrays [0, 4, 2] and [1, 2, 3] is impossible with k=3. After the modification, you can apply the operation with x=1 to the whole first array (its length is equal to k), and it will be equal to the second array.

In order to make arrays equal in the second sample before changes, you can apply operations with x=1 on subarray [1, 2] of a and with x=2 on subarray [2, 3] of b.

After all queries arrays will be equal [0, 3, 2] and [1, 0, 0]. The same operations make them equal [1, 2, 2].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline", "no-stack-protector", "unroll-loops")
using namespace std;
const int N = 202005, S = 200;
int n, k, q;
namespace Brute_Force {
int a[N], b[N], c[N], pre[N];
int ans, cnt;
inline void init() {
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
}
inline void update(int p, int v) {
  v ^= c[p];
  for (int i = p; i <= n; i += k) {
    pre[i] ^= v;
    if (v && pre[i] == 0) --ans;
    if (v && pre[i] == v) ++ans;
  }
  int lst = p % k + ((n - p % k) / k) * k;
  if (v && pre[lst] == 0) --cnt;
  if (v && pre[lst] == v) ++cnt;
  c[p] ^= v;
}
inline void print() { printf("%d\n", cnt ? -1 : ans); }
inline void work() {
  init();
  ++n;
  for (int i = 1; i <= n; i++) update(i, a[i - 1] ^ b[i - 1] ^ a[i] ^ b[i]);
  print();
  while (q--) {
    char opt;
    int x, y, t;
    cin >> opt >> x >> y;
    if (opt == 'a')
      a[x] = y;
    else
      b[x] = y;
    update(x, a[x - 1] ^ b[x - 1] ^ a[x] ^ b[x]);
    update(x + 1, a[x] ^ b[x] ^ a[x + 1] ^ b[x + 1]);
    print();
  }
}
}  // namespace Brute_Force
namespace Blocking {
int a[N], b[N], c[N], pre[N];
int bl[N], tag[N], st[N], d[1005][16387];
int ans, cnt, block;
inline void init() {
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
}
inline void update(int p, int v) {
  v ^= c[p];
  for (int i = p; bl[i] == bl[p]; i += k) {
    if (v && (pre[i] ^ tag[bl[p]]) == 0) ans++;
    d[bl[i]][pre[i]]--;
    d[bl[i]][pre[i] ^= v]++;
    if (v && (pre[i] ^ tag[bl[p]]) == 0) ans--;
  }
  for (int i = bl[p] + 1; i <= block && st[i] % k == p % k; i++) {
    if (v) ans += d[i][tag[i]];
    tag[i] ^= v;
    if (v) ans -= d[i][tag[i]];
  }
  int lst = p % k + ((n - p % k) / k) * k;
  if (v && (pre[lst] ^ tag[bl[lst]]) == 0) --cnt;
  if (v && (pre[lst] ^ tag[bl[lst]]) == v) ++cnt;
  c[p] ^= v;
}
inline void print() { printf("%d\n", cnt ? -1 : ans); }
inline void work() {
  init();
  ++n;
  int Size = sqrt(n);
  for (int i = 1; i <= k; i++) {
    for (int j = i; j <= n; j += k) {
      if (((j - 1) / k + 1) % Size == 1)
        st[++block] = j, d[block][0] = min(Size, (n - j) / k + 1);
      bl[j] = block;
    }
  }
  for (int i = 1; i <= n; i++) update(i, a[i - 1] ^ b[i - 1] ^ a[i] ^ b[i]);
  print();
  while (q--) {
    char opt;
    int x, y, t;
    cin >> opt >> x >> y;
    if (opt == 'a')
      a[x] = y;
    else
      b[x] = y;
    update(x, a[x - 1] ^ b[x - 1] ^ a[x] ^ b[x]);
    update(x + 1, a[x] ^ b[x] ^ a[x + 1] ^ b[x + 1]);
    print();
  }
}
}  // namespace Blocking
int main() {
  scanf("%d%d%d", &n, &k, &q);
  if (k >= S)
    Brute_Force::work();
  else
    Blocking::work();
  return 0;
}