Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Ivan knows some information about the string s. Namely, he remembers, that string t i occurs in string s at least k i times or more, he also remembers exactly k i positions where the string t i occurs in string s: these positions are x i, 1, x i, 2, ..., x i, k i. He remembers n such strings t i.
You are to reconstruct lexicographically minimal string s such that it fits all the information Ivan remembers. Strings t i and string s consist of small English letters only.
The first line contains single integer n (1 ≤ n ≤ 105) — the number of strings Ivan remembers.
The next n lines contain information about the strings. The i-th of these lines contains non-empty string t i, then positive integer k i, which equal to the number of times the string t i occurs in string s, and then k i distinct positive integers x i, 1, x i, 2, ..., x i, k i in increasing order — positions, in which occurrences of the string t i in the string s start. It is guaranteed that the sum of lengths of strings t i doesn't exceed 106, 1 ≤ x i, j ≤ 106, 1 ≤ k i ≤ 106, and the sum of all k i doesn't exceed 106. The strings t i can coincide.
It is guaranteed that the input data is not self-contradictory, and thus at least one answer always exists.
Print lexicographically minimal string that fits all the information Ivan remembers.
a 4 1 3 5 7
ab 2 1 5
ca 1 4
a 1 3
ab 1 1
aba 1 3
ab 2 3 5