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 long long mod = 1000000007;
char find_char(char a) {
  for (char j = 'a'; j <= 'z'; j++) {
    if (a != j) return j;
  }
}
char find_char(char a, char b) {
  for (char j = 'a'; j <= 'z'; j++) {
    if (a != j && b != j) return j;
  }
}
int main(int argc, char const *argv[]) {
  int n, t;
  while (cin >> n >> t) {
    int cnt = 0;
    string a;
    string b;
    cin >> a >> b;
    for (int i = 0; i < n; i++) {
      if (a[i] == b[i]) cnt++;
    }
    int _t = n - t;
    if (_t > cnt + (n - cnt) / 2) {
      printf("-1\n");
    } else {
      if (_t > cnt) {
        int temp1 = (_t - cnt);
        int temp2 = temp1;
        int ret = 1;
        for (int i = 0; i < n; i++) {
          if (a[i] == b[i]) {
            cout << a[i];
          } else {
            if (ret == 1) {
              cout << a[i];
              temp1--;
              if (temp1 == 0) {
                ret = 2;
              }
            } else if (ret == 2) {
              cout << b[i];
              temp2--;
              if (temp2 == 0) {
                ret = 3;
              }
            } else {
              printf("%c", find_char(a[i], b[i]));
            }
          }
        }
        printf("\n");
      } else {
        int temp = cnt - _t;
        for (int i = 0; i < n; i++) {
          if (a[i] != b[i]) {
            printf("%c", find_char(a[i], b[i]));
          } else {
            if (temp != 0) {
              temp--;
              printf("%c", find_char(a[i]));
            } else {
              cout << a[i];
            }
          }
        }
        printf("\n");
      }
    }
  }
  return 0;
}