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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
inline int Rand() { return (rand() << 16) | rand(); }
using namespace std;
const int N = 100001;
int n, m, kol, cmp, cmp2;
string s, ss, ans;
int sz, kol2;
bool ok;
int pos;
char other(char x, char y) {
  for (int i = 0; i < 26; i++) {
    if (char(i + 97) != x && char(i + 97) != y) return char(i + 97);
  }
}
int main() {
  srand(time(NULL));
  scanf("%d %d", &n, &m);
  cin >> s;
  m = n - m;
  cin >> ss;
  for (int i = 0; i < n; i++)
    if (s[i] == ss[i]) kol++;
  ans = s;
  if (n - kol < (m - kol) * 2) cout << -1, exit(0);
  kol = m - kol;
  for (int i = 0; i < n; i++) {
    if (s[i] == ss[i]) {
      if (m) {
        m--;
        ans[i] = s[i];
      } else {
        ans[i] = other(s[i], ss[i]);
      }
    } else if (kol > 0) {
      if (!ok)
        ans[i] = s[i], ok = true;
      else
        ans[i] = ss[i], ok = false, kol--;
    } else {
      ans[i] = other(s[i], ss[i]);
    }
  }
  cout << ans;
  return 0;
}