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>
using namespace std;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
long long mod = 1000000007;
long long mod_v(long long nn) { return nn % mod; }
template <class T>
T fast_pow(T n, T p) {
  if (p == 0) return 1;
  if (p % 2) {
    T g = mod_v(mod_v(n) * mod_v(fast_pow(n, p - 1)));
    return g;
  } else {
    T g = fast_pow(n, p / 2);
    g = mod_v(mod_v(g) * mod_v(g));
    return g;
  }
}
template <class T>
inline T modInverse(T n) {
  return fast_pow(n, mod - 2);
}
char a[1111111], b[1111111], c[1111111];
int n, t;
bool chk[1111111];
int main() {
  scanf("%d %d ", &n, &t);
  scanf("%s", &a);
  scanf("%s", &b);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 26; j++) {
      char p = (char)(j + 'a');
      if (a[i] != p && b[i] != p) {
        c[i] = p;
        break;
      }
    }
  }
  t = n - t;
  for (int i = 0; i < n && t; i++) {
    if (a[i] == b[i]) {
      if (!chk[i]) {
        c[i] = a[i];
        t--;
        chk[i] = 1;
      }
    }
  }
  if (t) {
    int ta = t;
    int tb = t;
    int turn = 0;
    for (int i = 0; i < n && (ta || tb); i++) {
      if (chk[i]) continue;
      if (turn) {
        c[i] = a[i];
        turn = !turn;
        ta--;
      } else {
        c[i] = b[i];
        turn = !turn;
        tb--;
      }
    }
    t = max(tb, ta);
  }
  if (t) {
    cout << "-1\n";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    cout << c[i];
  }
  cout << endl;
  return 0;
}