#include <bits/stdc++.h>
using namespace std;
string a, b;
char get(char ch1, char ch2) {
  for (int i = 'a'; i <= 'z'; i++)
    if (i != ch1 && i != ch2) return (char)i;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n, k;
  cin >> n >> k;
  cin >> a >> b;
  int cnt = 0;
  for (int i = 0; i < n; i++) cnt += (a[i] != b[i]);
  if ((cnt - k) * 2 > cnt)
    cout << -1 << '\n';
  else if (cnt > k) {
    cnt = cnt - k;
    string ans = a;
    bitset<100010> bs;
    bs.reset();
    for (int i = 0, j = 0; i < n && j < cnt; i++) {
      if (a[i] != b[i]) {
        ans[i] = a[i];
        bs[i] = 1;
        j++;
      }
    }
    for (int i = 0, j = 0; j < n && j < cnt; i++) {
      if (a[i] != b[i] && !bs[i]) {
        ans[i] = b[i];
        bs[i] = 1;
        j++;
      }
    }
    for (int i = 0; i < n; i++) {
      if (!bs[i] && a[i] != b[i]) {
        ans[i] = get(a[i], b[i]);
      }
    }
    cout << ans << '\n';
  } else {
    int dif = k - cnt;
    string ans = "";
    for (int i = 0; i < n; i++) {
      if (a[i] != b[i]) {
        ans += get(a[i], b[i]);
      } else if (a[i] == b[i] && dif) {
        ans += get(a[i], b[i]);
        dif--;
      } else {
        ans += a[i];
      }
    }
    cout << ans << endl;
  }
  return 0;
}

### Prompt

Your task is to create 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;
string a, b;
char get(char ch1, char ch2) {
  for (int i = 'a'; i <= 'z'; i++)
    if (i != ch1 && i != ch2) return (char)i;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n, k;
  cin >> n >> k;
  cin >> a >> b;
  int cnt = 0;
  for (int i = 0; i < n; i++) cnt += (a[i] != b[i]);
  if ((cnt - k) * 2 > cnt)
    cout << -1 << '\n';
  else if (cnt > k) {
    cnt = cnt - k;
    string ans = a;
    bitset<100010> bs;
    bs.reset();
    for (int i = 0, j = 0; i < n && j < cnt; i++) {
      if (a[i] != b[i]) {
        ans[i] = a[i];
        bs[i] = 1;
        j++;
      }
    }
    for (int i = 0, j = 0; j < n && j < cnt; i++) {
      if (a[i] != b[i] && !bs[i]) {
        ans[i] = b[i];
        bs[i] = 1;
        j++;
      }
    }
    for (int i = 0; i < n; i++) {
      if (!bs[i] && a[i] != b[i]) {
        ans[i] = get(a[i], b[i]);
      }
    }
    cout << ans << '\n';
  } else {
    int dif = k - cnt;
    string ans = "";
    for (int i = 0; i < n; i++) {
      if (a[i] != b[i]) {
        ans += get(a[i], b[i]);
      } else if (a[i] == b[i] && dif) {
        ans += get(a[i], b[i]);
        dif--;
      } else {
        ans += a[i];
      }
    }
    cout << ans << endl;
  }
  return 0;
}

```