#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, t, t1;
  cin >> n >> t;
  t1 = n - t;
  string a, b, ans;
  cin >> a >> b;
  for (int i = 0; i < n; i++) ans += " ";
  set<int> dd;
  for (int i = 0; i < n; i++) dd.insert(i);
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i] && t1 > 0) t1--, ans[i] = a[i], dd.erase(i);
  }
  while (t1 > 0) {
    if (dd.empty()) break;
    ans[*dd.begin()] = a[*dd.begin()];
    dd.erase(*dd.begin());
    if (!dd.empty()) {
      ans[*dd.begin()] = b[*dd.begin()];
      dd.erase(*dd.begin());
      t1--;
    }
  }
  while (dd.size() != 0) {
    for (char i = 'a'; i <= 'z'; i++)
      if (a[*dd.begin()] != i && b[*dd.begin()] != i) {
        ans[*dd.begin()] = i, dd.erase(dd.begin());
        break;
      }
  }
  int q = 0, w = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] != ans[i]) q++;
    if (b[i] != ans[i]) w++;
  }
  if (q != t || w != t) return cout << -1, 0;
  cout << ans;
  return 0;
}

### Prompt

Please formulate a CPP solution to 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;
int main() {
  int n, t, t1;
  cin >> n >> t;
  t1 = n - t;
  string a, b, ans;
  cin >> a >> b;
  for (int i = 0; i < n; i++) ans += " ";
  set<int> dd;
  for (int i = 0; i < n; i++) dd.insert(i);
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i] && t1 > 0) t1--, ans[i] = a[i], dd.erase(i);
  }
  while (t1 > 0) {
    if (dd.empty()) break;
    ans[*dd.begin()] = a[*dd.begin()];
    dd.erase(*dd.begin());
    if (!dd.empty()) {
      ans[*dd.begin()] = b[*dd.begin()];
      dd.erase(*dd.begin());
      t1--;
    }
  }
  while (dd.size() != 0) {
    for (char i = 'a'; i <= 'z'; i++)
      if (a[*dd.begin()] != i && b[*dd.begin()] != i) {
        ans[*dd.begin()] = i, dd.erase(dd.begin());
        break;
      }
  }
  int q = 0, w = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] != ans[i]) q++;
    if (b[i] != ans[i]) w++;
  }
  if (q != t || w != t) return cout << -1, 0;
  cout << ans;
  return 0;
}

```