#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, t, cnt, cnt1, cnt2, t1, t2;
  scanf("%d", &n);
  scanf("%d", &t);
  char a[n + 1], b[n + 1], res[n + 1];
  scanf("%s", a);
  scanf("%s", b);
  for (long long int i = 0; i < n; ++i) {
    res[i] = '.';
  }
  res[n] = '\0';
  cnt = n - t;
  for (long long int i = 0; i < n; ++i) {
    if (cnt == 0) {
      break;
    }
    if (a[i] == b[i]) {
      res[i] = a[i];
      cnt--;
    }
  }
  t1 = 0;
  t2 = 0;
  if (cnt > 0) {
    cnt1 = cnt2 = cnt;
    for (long long int i = 0; i < n; ++i) {
      if (res[i] == '.') {
        if (cnt1 > cnt2) {
          res[i] = a[i];
          cnt1--;
          t2++;
        } else {
          res[i] = b[i];
          cnt2--;
          t1++;
        }
      }
      if (cnt1 == 0 && cnt2 == 0) {
        break;
      }
    }
  }
  for (long long int i = 0; i < n; ++i) {
    if (res[i] == '.') {
      for (char c = 'a'; c <= 'z'; c++) {
        if (c != a[i] && c != b[i]) {
          res[i] = c;
          t1++;
          t2++;
          break;
        }
      }
    }
  }
  if (t1 != t || t2 != t) {
    printf("%s", "-1\n");
    return 0;
  }
  printf("%s", res);
  printf("\n");
  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;
int main() {
  int n, t, cnt, cnt1, cnt2, t1, t2;
  scanf("%d", &n);
  scanf("%d", &t);
  char a[n + 1], b[n + 1], res[n + 1];
  scanf("%s", a);
  scanf("%s", b);
  for (long long int i = 0; i < n; ++i) {
    res[i] = '.';
  }
  res[n] = '\0';
  cnt = n - t;
  for (long long int i = 0; i < n; ++i) {
    if (cnt == 0) {
      break;
    }
    if (a[i] == b[i]) {
      res[i] = a[i];
      cnt--;
    }
  }
  t1 = 0;
  t2 = 0;
  if (cnt > 0) {
    cnt1 = cnt2 = cnt;
    for (long long int i = 0; i < n; ++i) {
      if (res[i] == '.') {
        if (cnt1 > cnt2) {
          res[i] = a[i];
          cnt1--;
          t2++;
        } else {
          res[i] = b[i];
          cnt2--;
          t1++;
        }
      }
      if (cnt1 == 0 && cnt2 == 0) {
        break;
      }
    }
  }
  for (long long int i = 0; i < n; ++i) {
    if (res[i] == '.') {
      for (char c = 'a'; c <= 'z'; c++) {
        if (c != a[i] && c != b[i]) {
          res[i] = c;
          t1++;
          t2++;
          break;
        }
      }
    }
  }
  if (t1 != t || t2 != t) {
    printf("%s", "-1\n");
    return 0;
  }
  printf("%s", res);
  printf("\n");
  return 0;
}

```