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;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
long long int fexp(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 1000000007;
    b /= 2;
    a = a * a % 1000000007;
  }
  return ans;
}
long long int inverse(long long int a, long long int p) {
  return fexp(a, p - 2);
}
void ingraph(vector<vector<long long int> >& graph, long long int m) {
  long long int x, y;
  for (long long int i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
}
char getran(char a, char b) {
  for (char x = 'a'; x < 'z'; x++) {
    if (x != a && x != b) return x;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    long long int n, t;
    cin >> n >> t;
    string x, y;
    cin >> x >> y;
    vector<long long int> diff, sam;
    for (long long int i = 0; i < n; i++) {
      if (x[i] == y[i])
        sam.push_back(i);
      else
        diff.push_back(i);
    }
    if (diff.size() > 2 * t)
      cout << -1 << endl;
    else {
      char ans[n];
      if (diff.size() <= t) {
        for (long long int i = 0; i < diff.size(); i++) {
          ans[diff[i]] = getran(x[diff[i]], y[diff[i]]);
          t--;
        }
        long long int j = 0;
        while (t) {
          ans[sam[j]] = getran('a', x[sam[j]]);
          t--;
          j++;
        }
        for (long long int i = j; i < sam.size(); i++) ans[sam[i]] = x[sam[i]];
      } else {
        long long int j = 0;
        for (long long int i = 0; i < diff.size() - t; i++) {
          ans[diff[j]] = y[diff[j]];
          j++;
        }
        for (long long int i = 0; i < diff.size() - t; i++) {
          ans[diff[j]] = x[diff[j]];
          j++;
        }
        for (long long int i = 0; i < 2 * t - diff.size(); i++) {
          ans[diff[j]] = getran(x[diff[j]], y[diff[j]]);
          j++;
        }
        for (long long int i = 0; i < sam.size(); i++) ans[sam[i]] = x[sam[i]];
      }
      for (long long int i = 0; i < n; i++) cout << ans[i];
    }
  }
}