#include <bits/stdc++.h>
using namespace std;
char s1[100005], s2[100005], s3[100005];
bool vis[100005];
int n, t;
int cnt;
bool flag;
void build() {
  cnt = 0;
  if (cnt == t) return;
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      s3[i] = s1[i];
      vis[i] = true;
      cnt++;
      if (cnt == t) return;
    }
  }
  flag = true;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) {
      vis[i] = true;
      if (flag)
        s3[i] = s1[i];
      else
        s3[i] = s2[i];
      flag = !flag;
      if (flag) cnt++;
      if (cnt == t) return;
    }
  }
}
int main() {
  cin >> n >> t;
  cin >> s1 >> s2;
  t = n - t;
  build();
  s3[n] = '\0';
  if (cnt < t) {
    cout << "-1" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (!vis[i]) {
      for (int j = 'a'; j <= 'z'; j++)
        if (j != s1[i] && j != s2[i]) {
          s3[i] = j;
          break;
        }
    }
  }
  cout << s3;
  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;
char s1[100005], s2[100005], s3[100005];
bool vis[100005];
int n, t;
int cnt;
bool flag;
void build() {
  cnt = 0;
  if (cnt == t) return;
  for (int i = 0; i < n; i++) {
    if (s1[i] == s2[i]) {
      s3[i] = s1[i];
      vis[i] = true;
      cnt++;
      if (cnt == t) return;
    }
  }
  flag = true;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) {
      vis[i] = true;
      if (flag)
        s3[i] = s1[i];
      else
        s3[i] = s2[i];
      flag = !flag;
      if (flag) cnt++;
      if (cnt == t) return;
    }
  }
}
int main() {
  cin >> n >> t;
  cin >> s1 >> s2;
  t = n - t;
  build();
  s3[n] = '\0';
  if (cnt < t) {
    cout << "-1" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (!vis[i]) {
      for (int j = 'a'; j <= 'z'; j++)
        if (j != s1[i] && j != s2[i]) {
          s3[i] = j;
          break;
        }
    }
  }
  cout << s3;
  return 0;
}

```