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 n, t;
string s1, s2, s3;
int getDiff() {
  int nr = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) nr++;
  }
  return nr;
}
char getOther(char a, char b) {
  if (a == 'a' || b == 'a') {
    if (a == 'b' || b == 'b') {
      return 'c';
    }
    return 'b';
  }
  return 'a';
}
int main() {
  cin >> n >> t >> s1 >> s2;
  int k = getDiff();
  if (t < (k + 1) / 2) {
    cout << "-1\n";
    return 0;
  }
  if (k <= t) {
    int modif = t - k;
    for (int i = 0; i < n; i++) {
      if (s1[i] != s2[i]) {
        s3 += getOther(s1[i], s2[i]);
      } else {
        if (modif > 0) {
          s3 += getOther(s1[i], s2[i]);
          modif--;
        } else {
          s3 += s1[i];
        }
      }
    }
  }
  if (k > t) {
    int modif = k - t;
    bool first = true;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i]) {
        s3 += s1[i];
      } else {
        if (first) {
          s3 += s1[i];
          modif--;
          if (modif == 0) {
            first = false;
            modif = k - t;
          }
        } else {
          if (modif > 0) {
            s3 += s2[i];
            modif--;
          } else {
            s3 += getOther(s1[i], s2[i]);
          }
        }
      }
    }
  }
  cout << s3 << "\n";
  return 0;
}