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 N = 85;
char get(char a, char b) {
  for (char i = 'a'; i <= 'z'; i++) {
    if (a != i && b != i) return i;
  }
}
int main() {
  int n, t, same = 0;
  string a, b, c;
  t = n - t;
  cin >> n >> t >> a >> b;
  c = a;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) same++;
  }
  t = n - t;
  if ((t - same) * 2 + same > n) {
    cout << -1;
    return 0;
  }
  int x = t, y = t;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) {
      if (x > 0 && y > 0)
        x--, y--;
      else {
        c[i] = get(a[i], b[i]);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (a[i] != b[i]) {
      if (x) {
        x--;
        c[i] = a[i];
      } else if (y) {
        y--;
        c[i] = b[i];
      } else
        c[i] = get(a[i], b[i]);
    }
  }
  cout << c;
  return 0;
}