#include <bits/stdc++.h>
using namespace std;
int n, t, g, k, s;
string s1, s2;
vector<char> ans;
vector<int> giong, khac;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n >> t >> s1 >> s2;
  for (int i = 0; i < n; i++)
    if (s1[i] == s2[i])
      giong.push_back(i);
    else
      khac.push_back(i);
  for (int i = 1; i <= n; i++) ans.push_back(' ');
  s = n - t;
  g = giong.size(), k = khac.size();
  int doi = (k + 1) >> 1;
  if (doi > t || n < t) {
    cout << -1;
    return 0;
  }
  int dem = 0;
  for (int i = 0; i < g; i++) {
    int u = giong[i];
    if (dem < s)
      ans[u] = s1[u], dem++;
    else
      ans[u] = (s1[u] == 'z' ? 'a' : s1[u] + 1);
  }
  int las = k - 1;
  if (k & 1) {
    las--;
    int u = khac[k - 1];
    for (int i = 'a'; i <= 'z'; i++)
      if (i != s1[u] && i != s2[u]) {
        ans[u] = i;
        break;
      }
  }
  for (int i = 0; i <= las; i += 2) {
    int u = khac[i], v = khac[i + 1];
    if (dem < s) {
      ans[u] = s1[u];
      ans[v] = s2[v];
      dem++;
    } else {
      for (int i = 'a'; i <= 'z'; i++)
        if (i != s1[u] && i != s2[u]) {
          ans[u] = i;
          break;
        }
      for (int i = 'a'; i <= 'z'; i++)
        if (i != s1[v] && i != s2[v]) {
          ans[v] = i;
          break;
        }
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i];
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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 n, t, g, k, s;
string s1, s2;
vector<char> ans;
vector<int> giong, khac;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n >> t >> s1 >> s2;
  for (int i = 0; i < n; i++)
    if (s1[i] == s2[i])
      giong.push_back(i);
    else
      khac.push_back(i);
  for (int i = 1; i <= n; i++) ans.push_back(' ');
  s = n - t;
  g = giong.size(), k = khac.size();
  int doi = (k + 1) >> 1;
  if (doi > t || n < t) {
    cout << -1;
    return 0;
  }
  int dem = 0;
  for (int i = 0; i < g; i++) {
    int u = giong[i];
    if (dem < s)
      ans[u] = s1[u], dem++;
    else
      ans[u] = (s1[u] == 'z' ? 'a' : s1[u] + 1);
  }
  int las = k - 1;
  if (k & 1) {
    las--;
    int u = khac[k - 1];
    for (int i = 'a'; i <= 'z'; i++)
      if (i != s1[u] && i != s2[u]) {
        ans[u] = i;
        break;
      }
  }
  for (int i = 0; i <= las; i += 2) {
    int u = khac[i], v = khac[i + 1];
    if (dem < s) {
      ans[u] = s1[u];
      ans[v] = s2[v];
      dem++;
    } else {
      for (int i = 'a'; i <= 'z'; i++)
        if (i != s1[u] && i != s2[u]) {
          ans[u] = i;
          break;
        }
      for (int i = 'a'; i <= 'z'; i++)
        if (i != s1[v] && i != s2[v]) {
          ans[v] = i;
          break;
        }
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i];
  return 0;
}

```