#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long INF = 1LL << 60;
bool compareA(vector<int> a, vector<int> b) {
  return abs(a[0]) + abs(a[1]) < abs(b[0]) + abs(b[1]);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n, t;
  cin >> n >> t;
  string s1, s2;
  cin >> s1 >> s2;
  long long same = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      same++;
    }
  }
  long long diff = n - same;
  if ((diff % 2 == 0 && t < diff / 2) || (diff % 2 == 1 && t <= diff / 2)) {
    cout << -1;
    return 0;
  }
  string out;
  long long keepSame = min(n - t, same);
  long long keepOne = 2 * (n - keepSame - t);
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      if (keepSame > 0) {
        keepSame--;
        out += s1[i];
      } else {
        for (int j = 0; j < 26; j++) {
          if (j != s1[i] - 'a') {
            out += (char)(j + 'a');
            break;
          }
        }
      }
    } else {
      if (keepOne > 0) {
        if (keepOne % 2 == 0) {
          out += s1[i];
        } else {
          out += s2[i];
        }
        keepOne--;
      } else {
        for (int j = 0; j < 26; j++) {
          if (j != s1[i] - 'a' && j != s2[i] - 'a') {
            out += (char)(j + 'a');
            break;
          }
        }
      }
    }
  }
  cout << out;
}

### 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;
long long MOD = 1000000007;
long long INF = 1LL << 60;
bool compareA(vector<int> a, vector<int> b) {
  return abs(a[0]) + abs(a[1]) < abs(b[0]) + abs(b[1]);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n, t;
  cin >> n >> t;
  string s1, s2;
  cin >> s1 >> s2;
  long long same = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      same++;
    }
  }
  long long diff = n - same;
  if ((diff % 2 == 0 && t < diff / 2) || (diff % 2 == 1 && t <= diff / 2)) {
    cout << -1;
    return 0;
  }
  string out;
  long long keepSame = min(n - t, same);
  long long keepOne = 2 * (n - keepSame - t);
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      if (keepSame > 0) {
        keepSame--;
        out += s1[i];
      } else {
        for (int j = 0; j < 26; j++) {
          if (j != s1[i] - 'a') {
            out += (char)(j + 'a');
            break;
          }
        }
      }
    } else {
      if (keepOne > 0) {
        if (keepOne % 2 == 0) {
          out += s1[i];
        } else {
          out += s2[i];
        }
        keepOne--;
      } else {
        for (int j = 0; j < 26; j++) {
          if (j != s1[i] - 'a' && j != s2[i] - 'a') {
            out += (char)(j + 'a');
            break;
          }
        }
      }
    }
  }
  cout << out;
}

```