#include <bits/stdc++.h>
using namespace std;
int n, t;
char s1[100005], s2[100005];
char findch(char a, char b) {
  for (char c = 'a';; c++) {
    if (c != a && c != b) {
      return c;
    }
  }
}
int main() {
  scanf("%d%d%s%s", &n, &t, s1, s2);
  int diff = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) {
      diff++;
    }
  }
  if (t >= diff) {
    int crt = 0;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i] && crt < n - t) {
        crt++;
        continue;
      }
      s1[i] = findch(s1[i], s2[i]);
    }
    puts(s1);
  } else if (t >= (diff + 1) / 2 && t) {
    int crt1 = 0, crt2 = diff;
    for (int i = 0; i < n; i++) {
      if (s1[i] != s2[i]) {
        if (crt1 < t && crt2 > t) {
          s1[i] = s2[i];
          crt1++;
          crt2--;
        } else if (crt1 < t) {
          s1[i] = findch(s1[i], s2[i]);
          crt1++;
        }
      }
    }
    puts(s1);
  } else {
    puts("-1");
  }
}

### Prompt

Please formulate a CPP solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int n, t;
char s1[100005], s2[100005];
char findch(char a, char b) {
  for (char c = 'a';; c++) {
    if (c != a && c != b) {
      return c;
    }
  }
}
int main() {
  scanf("%d%d%s%s", &n, &t, s1, s2);
  int diff = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) {
      diff++;
    }
  }
  if (t >= diff) {
    int crt = 0;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i] && crt < n - t) {
        crt++;
        continue;
      }
      s1[i] = findch(s1[i], s2[i]);
    }
    puts(s1);
  } else if (t >= (diff + 1) / 2 && t) {
    int crt1 = 0, crt2 = diff;
    for (int i = 0; i < n; i++) {
      if (s1[i] != s2[i]) {
        if (crt1 < t && crt2 > t) {
          s1[i] = s2[i];
          crt1++;
          crt2--;
        } else if (crt1 < t) {
          s1[i] = findch(s1[i], s2[i]);
          crt1++;
        }
      }
    }
    puts(s1);
  } else {
    puts("-1");
  }
}

```