#include <bits/stdc++.h>
using namespace std;
char a[110000], b[110000];
char c[110000];
char getc(char x, char y) {
  char t = 'a';
  while (t == x || t == y) t++;
  return t;
}
int main() {
  int n, t;
  scanf("%d%d", &n, &t);
  scanf("%s%s", a, b);
  int sm = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) {
      sm++;
    }
  }
  int ds = n - sm;
  int an, bn, cn, dn;
  bool flag = false;
  for (int i = 0; i <= ds; i++) {
    dn = i;
    cn = ds - 2 * dn;
    if (cn < 0) break;
    bn = t - cn - dn;
    if (bn < 0) continue;
    an = sm - bn;
    if (an < 0) continue;
    flag = true;
    break;
  }
  if (flag == false) {
    printf("-1\n");
    return 0;
  }
  int ad = dn, bd = dn;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) {
      if (an > 0) {
        c[i] = a[i];
        an--;
      } else {
        c[i] = 'z' == a[i] ? 'a' : a[i] + 1;
      }
    } else {
      if (cn > 0) {
        c[i] = getc(a[i], b[i]);
        cn--;
      } else {
        if (ad > 0) {
          c[i] = a[i];
          ad--;
        } else {
          c[i] = b[i];
        }
      }
    }
  }
  c[n] = '\0';
  printf("%s\n", c);
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
char a[110000], b[110000];
char c[110000];
char getc(char x, char y) {
  char t = 'a';
  while (t == x || t == y) t++;
  return t;
}
int main() {
  int n, t;
  scanf("%d%d", &n, &t);
  scanf("%s%s", a, b);
  int sm = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) {
      sm++;
    }
  }
  int ds = n - sm;
  int an, bn, cn, dn;
  bool flag = false;
  for (int i = 0; i <= ds; i++) {
    dn = i;
    cn = ds - 2 * dn;
    if (cn < 0) break;
    bn = t - cn - dn;
    if (bn < 0) continue;
    an = sm - bn;
    if (an < 0) continue;
    flag = true;
    break;
  }
  if (flag == false) {
    printf("-1\n");
    return 0;
  }
  int ad = dn, bd = dn;
  for (int i = 0; i < n; i++) {
    if (a[i] == b[i]) {
      if (an > 0) {
        c[i] = a[i];
        an--;
      } else {
        c[i] = 'z' == a[i] ? 'a' : a[i] + 1;
      }
    } else {
      if (cn > 0) {
        c[i] = getc(a[i], b[i]);
        cn--;
      } else {
        if (ad > 0) {
          c[i] = a[i];
          ad--;
        } else {
          c[i] = b[i];
        }
      }
    }
  }
  c[n] = '\0';
  printf("%s\n", c);
}

```