#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 2;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char a[100009], b[100009], c[100009];
  int i, j, n, t, f = 1, ac = 0, bc = 0, eq, nq = 0;
  cin >> n >> t;
  cin >> a >> b;
  eq = n - t;
  for (i = 0; i < n; ++i) c[i] = '0';
  for (i = 0; i < n; ++i) {
    if (a[i] != b[i]) ++nq;
  }
  i = 0;
  while (eq && i < n) {
    if (a[i] == b[i]) {
      c[i] = a[i];
      --eq;
    }
    ++i;
  }
  if (eq > nq * 2) {
    cout << -1;
    return 0;
  }
  if (eq) {
    for (i = 0; i < n && eq; ++i) {
      if (a[i] != b[i]) {
        if (f == 1)
          c[i] = a[i], ++ac;
        else
          c[i] = b[i], ++bc;
        if (f == -1) --eq;
        f *= -1;
      }
    }
    if (ac != bc || eq) {
      cout << -1;
      return 0;
    }
  }
  for (i = 0; i < n; ++i) {
    if (c[i] == '0') {
      for (j = 'a'; j <= 'z'; ++j)
        if (a[i] != j && b[i] != j) c[i] = j;
    }
  }
  for (i = 0; i < n; ++i) cout << c[i];
}

### Prompt

Create a solution in cpp for the following problem:

Marina loves strings of the same length and Vasya loves when there is a third string, different from them in exactly t characters. Help Vasya find at least one such string.

More formally, you are given two strings s1, s2 of length n and number t. Let's denote as f(a, b) the number of characters in which strings a and b are different. Then your task will be to find any string s3 of length n, such that f(s1, s3) = f(s2, s3) = t. If there is no such string, print  - 1.

Input

The first line contains two integers n and t (1 ≤ n ≤ 105, 0 ≤ t ≤ n).

The second line contains string s1 of length n, consisting of lowercase English letters.

The third line contain string s2 of length n, consisting of lowercase English letters.

Output

Print a string of length n, differing from string s1 and from s2 in exactly t characters. Your string should consist only from lowercase English letters. If such string doesn't exist, print -1.

Examples

Input

3 2
abc
xyc


Output

ayd

Input

1 0
c
b


Output

-1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 2;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char a[100009], b[100009], c[100009];
  int i, j, n, t, f = 1, ac = 0, bc = 0, eq, nq = 0;
  cin >> n >> t;
  cin >> a >> b;
  eq = n - t;
  for (i = 0; i < n; ++i) c[i] = '0';
  for (i = 0; i < n; ++i) {
    if (a[i] != b[i]) ++nq;
  }
  i = 0;
  while (eq && i < n) {
    if (a[i] == b[i]) {
      c[i] = a[i];
      --eq;
    }
    ++i;
  }
  if (eq > nq * 2) {
    cout << -1;
    return 0;
  }
  if (eq) {
    for (i = 0; i < n && eq; ++i) {
      if (a[i] != b[i]) {
        if (f == 1)
          c[i] = a[i], ++ac;
        else
          c[i] = b[i], ++bc;
        if (f == -1) --eq;
        f *= -1;
      }
    }
    if (ac != bc || eq) {
      cout << -1;
      return 0;
    }
  }
  for (i = 0; i < n; ++i) {
    if (c[i] == '0') {
      for (j = 'a'; j <= 'z'; ++j)
        if (a[i] != j && b[i] != j) c[i] = j;
    }
  }
  for (i = 0; i < n; ++i) cout << c[i];
}

```