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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxl = 100000;
char s1[maxl + 5];
char s2[maxl + 5];
char s3[maxl + 5];
int n, t;
char change(char ch) {
  for (char c = 'a'; c <= 'z'; c++) {
    if (c != ch) {
      return c;
    }
  }
}
char change(char ch1, char ch2) {
  for (char c = 'a'; c <= 'z'; c++) {
    if (c != ch1 && c != ch2) {
      return c;
    }
  }
}
int main() {
  scanf("%d%d\n", &n, &t);
  scanf("%s\n", s1);
  scanf("%s\n", s2);
  int diff = 0;
  for (int i = 0; i < n; i++) {
    if (s1[i] != s2[i]) {
      diff++;
    }
  }
  if (t == 0) {
    if (diff == 0) {
      printf("%s\n", s1);
    } else {
      printf("-1\n");
    }
    return 0;
  }
  if (t <= (diff - 1) / 2 || t > n) {
    printf("-1\n");
  } else {
    memset(s3, 0, sizeof s3);
    for (int i = 0; i < n && t > diff; i++) {
      if (s1[i] == s2[i]) {
        t--;
        s3[i] = change(s1[i]);
      }
    }
    int q1 = diff - t;
    int q2 = diff - t;
    for (int i = 0; i < n; i++) {
      if (s3[i] != 0) {
        continue;
      }
      if (s1[i] == s2[i]) {
        s3[i] = s1[i];
      } else {
        if (q1) {
          s3[i] = s1[i];
          q1--;
        } else if (q2) {
          s3[i] = s2[i];
          q2--;
        } else {
          s3[i] = change(s1[i], s2[i]);
        }
      }
    }
    printf("%s\n", s3);
  }
  return 0;
}