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 main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, t;
  cin >> n >> t;
  string s1, s2;
  cin >> s1 >> s2;
  string ans(n, 0);
  long long int tmp = n - t;
  for (long long int i = 0; i < n; i++) {
    if (tmp == 0) break;
    if (s1[i] == s2[i]) {
      tmp--;
      ans[i] = s1[i];
    }
  }
  long long int f = tmp, s = tmp;
  for (long long int i = 0; i < n; i++) {
    if (f == 0 and s == 0) break;
    if (f > 0 and s1[i] != s2[i]) {
      ans[i] = s1[i];
      f--;
    } else if (s > 0 and s1[i] != s2[i]) {
      ans[i] = s2[i];
      s--;
    }
  }
  for (long long int i = 0; i < n; i++) {
    if (ans[i] == 0) {
      if (s1[i] != 'a' and s2[i] != 'a')
        ans[i] = 'a';
      else if (s1[i] != 'b' and s2[i] != 'b')
        ans[i] = 'b';
      else
        ans[i] = 'c';
    }
  }
  if (f > 0 or s > 0)
    cout << -1;
  else
    cout << ans;
  return 0;
}