#include <bits/stdc++.h>
const int maxn = 100010;
char str1[maxn], str2[maxn];
char ans[maxn];
void getNextDiff(char *&s1, char *&s2, char *&sa) {
  while (*s1 == *s2) {
    *sa = *s1;
    s1++;
    s2++;
    sa++;
  }
}
char getDiffChar(char a, char b) {
  char re = 'a';
  while (re == a || re == b) re++;
  return re;
}
int main() {
  int n, t, m, l;
  while (scanf("%d%d", &n, &t) == 2) {
    scanf("%s%s", str1, str2);
    m = 0;
    for (int i = 0; i < n; i++)
      if (str1[i] != str2[i]) m++;
    if (m > 2 * t) {
      printf("-1\n");
      continue;
    }
    l = m - t;
    char *s1 = str1, *s2 = str2, *sa = ans;
    if (l > 0) {
      for (int i = 0; i < l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = *s1;
        sa++;
        s1++;
        s2++;
      }
      for (int i = 0; i < l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = *s2;
        sa++;
        s1++;
        s2++;
      }
      for (int i = 0; i < t - l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = getDiffChar(*s1, *s2);
        sa++;
        s1++;
        s2++;
      }
      while (*s1 != NULL) {
        *sa = *s1;
        s1++;
        sa++;
      }
    } else {
      l = t - m;
      for (int i = 0; i < l; i++) {
        while (*s1 != *s2) {
          *sa = getDiffChar(*s1, *s2);
          s1++;
          s2++;
          sa++;
        }
        *sa = getDiffChar(*s1, *s1);
        s1++;
        s2++;
        sa++;
      }
      while (*s1 != NULL) {
        if (*s1 == *s2) {
          *sa = *s1;
          sa++;
          s1++;
          s2++;
        } else {
          *sa = getDiffChar(*s1, *s2);
          s1++;
          s2++;
          sa++;
        }
      }
    }
    *sa = 0;
    puts(ans);
  }
  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>
const int maxn = 100010;
char str1[maxn], str2[maxn];
char ans[maxn];
void getNextDiff(char *&s1, char *&s2, char *&sa) {
  while (*s1 == *s2) {
    *sa = *s1;
    s1++;
    s2++;
    sa++;
  }
}
char getDiffChar(char a, char b) {
  char re = 'a';
  while (re == a || re == b) re++;
  return re;
}
int main() {
  int n, t, m, l;
  while (scanf("%d%d", &n, &t) == 2) {
    scanf("%s%s", str1, str2);
    m = 0;
    for (int i = 0; i < n; i++)
      if (str1[i] != str2[i]) m++;
    if (m > 2 * t) {
      printf("-1\n");
      continue;
    }
    l = m - t;
    char *s1 = str1, *s2 = str2, *sa = ans;
    if (l > 0) {
      for (int i = 0; i < l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = *s1;
        sa++;
        s1++;
        s2++;
      }
      for (int i = 0; i < l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = *s2;
        sa++;
        s1++;
        s2++;
      }
      for (int i = 0; i < t - l; i++) {
        getNextDiff(s1, s2, sa);
        *sa = getDiffChar(*s1, *s2);
        sa++;
        s1++;
        s2++;
      }
      while (*s1 != NULL) {
        *sa = *s1;
        s1++;
        sa++;
      }
    } else {
      l = t - m;
      for (int i = 0; i < l; i++) {
        while (*s1 != *s2) {
          *sa = getDiffChar(*s1, *s2);
          s1++;
          s2++;
          sa++;
        }
        *sa = getDiffChar(*s1, *s1);
        s1++;
        s2++;
        sa++;
      }
      while (*s1 != NULL) {
        if (*s1 == *s2) {
          *sa = *s1;
          sa++;
          s1++;
          s2++;
        } else {
          *sa = getDiffChar(*s1, *s2);
          s1++;
          s2++;
          sa++;
        }
      }
    }
    *sa = 0;
    puts(ans);
  }
  return 0;
}

```