We had a string s consisting of n lowercase Latin letters. We made k copies of this string, thus obtaining k identical strings s₁, s₂, ..., s_k. After that, in each of these strings we swapped exactly two characters (the characters we swapped could be identical, but they had different indices in the string).

You are given k strings s₁, s₂, ..., s_k, and you have to restore any string s so that it is possible to obtain these strings by performing aforementioned operations. Note that the total length of the strings you are given doesn't exceed 5000 (that is, k·n ≤ 5000).

Input

The first line contains two integers k and n (1 ≤ k ≤ 2500, 2 ≤ n ≤ 5000, k · n ≤ 5000) — the number of strings we obtained, and the length of each of these strings.

Next k lines contain the strings s₁, s₂, ..., s_k, each consisting of exactly n lowercase Latin letters.

Output

Print any suitable string s, or -1 if such string doesn't exist.

Note

In the first example s₁ is obtained by swapping the second and the fourth character in acab, s₂ is obtained by swapping the first and the second character, and to get s₃, we swap the third and the fourth character.

In the second example s₁ is obtained by swapping the third and the fourth character in kbub, s₂ — by swapping the second and the fourth, and s₃ — by swapping the first and the third.

In the third example it's impossible to obtain given strings by aforementioned operations.

Swapping Characters

Examples