584_C. Marina and Vasya
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
```python
fs = frozenset(list("abc"))

def calc(s1, s2):
    return len(list(filter(lambda x: x[0] == x[1], zip(s1, s2))))

if __name__ == '__main__':
    n, t = map(int, input().split())
    s1 = input()
    s2 = input()

    q = n - t
    c = calc(s1, s2)
    need = q - c
    w = 0

    ss = ['x'] * len(s1)

    if n - c >= 2 * need:
        for i in range(len(s1)):
            ss[i] = list(fs - frozenset(s1[i]) - frozenset(s2[i]))[0]
            if s1[i] == s2[i]:
                ss[i] = s1[i]

            if s1[i] == s2[i] and need < 0 and w > need:
                w -= 1
                ss[i] = list(fs - frozenset(s1[i]) - frozenset(s2[i]))[0]

            if s1[i] != s2[i] and need > 0 and w < 2 * need:
                if w >= need:
                    ss[i] = s2[i]
                else:
                    ss[i] = s1[i]

                w += 1

        print(''.join(ss))
    else:
        print('-1')
```