#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
char s1[maxn], s2[maxn], s3[maxn];
int n, t, sama, satu, dua;
int main() {
  scanf("%d %d", &n, &t);
  scanf("%s", s1);
  scanf("%s", s2);
  sama = satu = dua = 0;
  for (int i = 0; i < n; i++)
    if (s1[i] == s2[i]) sama++;
  int beda = n - sama;
  int half = 0;
  if (t >= beda) {
    int bedakan = t - beda;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i]) {
        if (bedakan) {
          s3[i] = s1[i] + 1;
          if (s3[i] > 'z') s3[i] = 'a';
          bedakan--;
          satu++;
          dua++;
        } else {
          s3[i] = s1[i];
        }
      } else if (s1[i] != s2[i]) {
        for (int j = 'a'; j <= 'z'; j++) {
          if (j != s1[i] && j != s2[i]) {
            s3[i] = j;
            break;
          }
        }
        satu++;
        dua++;
      }
    }
    if (bedakan > 0) {
      printf("-1\n");
      return 0;
    }
  } else if (t >= (int)floor((double)(beda + 1) / 2) && t < beda) {
    half = beda - t;
    half *= 2;
    for (int i = 0; i < n; i++) {
      if (s1[i] != s2[i]) {
        if (half) {
          if (half & 1) {
            s3[i] = s1[i];
            dua++;
          } else {
            s3[i] = s2[i];
            satu++;
          }
          half--;
        } else {
          for (int j = 'a'; j <= 'z'; j++) {
            if (j != s1[i] && j != s2[i]) {
              s3[i] = j;
              break;
            }
          }
          satu++;
          dua++;
        }
      } else {
        s3[i] = s1[i];
      }
    }
    if (half > 0) {
      printf("-1\n");
      return 0;
    }
  } else {
    printf("-1\n");
    return 0;
  }
  if (satu != t && dua != t)
    printf("-1\n");
  else
    printf("%s\n", s3);
  return 0;
}

### Prompt

In CPP, your task is to solve 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;
const int maxn = 100005;
char s1[maxn], s2[maxn], s3[maxn];
int n, t, sama, satu, dua;
int main() {
  scanf("%d %d", &n, &t);
  scanf("%s", s1);
  scanf("%s", s2);
  sama = satu = dua = 0;
  for (int i = 0; i < n; i++)
    if (s1[i] == s2[i]) sama++;
  int beda = n - sama;
  int half = 0;
  if (t >= beda) {
    int bedakan = t - beda;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i]) {
        if (bedakan) {
          s3[i] = s1[i] + 1;
          if (s3[i] > 'z') s3[i] = 'a';
          bedakan--;
          satu++;
          dua++;
        } else {
          s3[i] = s1[i];
        }
      } else if (s1[i] != s2[i]) {
        for (int j = 'a'; j <= 'z'; j++) {
          if (j != s1[i] && j != s2[i]) {
            s3[i] = j;
            break;
          }
        }
        satu++;
        dua++;
      }
    }
    if (bedakan > 0) {
      printf("-1\n");
      return 0;
    }
  } else if (t >= (int)floor((double)(beda + 1) / 2) && t < beda) {
    half = beda - t;
    half *= 2;
    for (int i = 0; i < n; i++) {
      if (s1[i] != s2[i]) {
        if (half) {
          if (half & 1) {
            s3[i] = s1[i];
            dua++;
          } else {
            s3[i] = s2[i];
            satu++;
          }
          half--;
        } else {
          for (int j = 'a'; j <= 'z'; j++) {
            if (j != s1[i] && j != s2[i]) {
              s3[i] = j;
              break;
            }
          }
          satu++;
          dua++;
        }
      } else {
        s3[i] = s1[i];
      }
    }
    if (half > 0) {
      printf("-1\n");
      return 0;
    }
  } else {
    printf("-1\n");
    return 0;
  }
  if (satu != t && dua != t)
    printf("-1\n");
  else
    printf("%s\n", s3);
  return 0;
}

```