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;
int diff(string a, string b, int n) {
  int res = 0;
  for (int i = 0; i < n; i++)
    if (a[i] != b[i]) res++;
  return res;
}
char other(char a, char b) {
  for (char i = 'a'; i <= 'z'; i++)
    if (i != a && i != b) return i;
  return ' ';
}
string solve(string a, string b, int n, int t) {
  string res = "";
  for (int i = 0; i < n; i++) res += other(a[i], b[i]);
  vector<int> e, d;
  for (int i = 0; i < n; i++)
    if (a[i] == b[i])
      e.push_back(i);
    else
      d.push_back(i);
  int cur = n;
  for (int i = 0; i < e.size(); i++)
    if (cur > t) {
      res[e[i]] = a[e[i]];
      cur--;
    }
  for (int i = 0; i + 1 < d.size(); i += 2)
    if (cur > t) {
      res[d[i]] = a[d[i]];
      res[d[i + 1]] = b[d[i + 1]];
      cur--;
    }
  if (cur > t)
    return "-1";
  else
    return res;
}
int main() {
  int n, t;
  string a, b;
  cin >> n >> t >> a >> b;
  cout << solve(a, b, n, t);
  return 0;
}