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;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = (0); i < (n); ++i) sum += v[i];
  return sum;
}
struct Sync_stdio {
  Sync_stdio() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
  }
} _sync_stdio;
int main() {
  int n, t;
  cin >> n >> t;
  t = n - t;
  string s1, s2;
  cin >> s1 >> s2;
  string s3(n, '?');
  for (int i = (0); i < (n); ++i) {
    if (t > 0 && s1[i] == s2[i]) {
      s3[i] = s1[i];
      --t;
    }
  }
  int i = 0;
  int j = 0;
  while (t > 0) {
    while (i < n && s3[i] != '?') {
      ++i;
    }
    j = i + 1;
    while (j < n && s3[j] != '?') {
      ++j;
    }
    if (i == n || j == n) {
      break;
    }
    s3[i] = s1[i];
    s3[j] = s2[j];
    --t;
  }
  if (t != 0) {
    cout << -1;
    return 0;
  }
  for (int i = (0); i < (n); ++i) {
    if (s3[i] == '?') {
      for (int j = ('a'); j < ('z' + 1); ++j) {
        if (s1[i] != j && s2[i] != j) {
          s3[i] = j;
          break;
        }
      }
    }
  }
  cout << s3;
}