String Reconstruction CodeForces - 828C(思维)

String Reconstruction

CodeForces - 828C

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, ki. 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.

Input

The first line contains single integer n (1 ≤ n ≤ 10⁵) — 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, ki 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 10⁶, 1 ≤ x_i, j ≤ 10⁶, 1 ≤ k_i ≤ 10⁶, and the sum of all k_i doesn't exceed 10⁶. 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.

Output

Print lexicographically minimal string that fits all the information Ivan remembers.

Examples

Input

3
a 4 1 3 5 7
ab 2 1 5
ca 1 4

Output

abacaba

Input

1
a 1 3

Output

aaa

Input

3
ab 1 1
aba 1 3
ab 2 3 5

Output

ababab

把每个字符串用一个string数组存下来，记录的时候只记录字符串在数组中的位置，把每个字符串的位置和这个字符串在string数组中的下标作为pair放入vector然后按照位置从小到大排序。
用len表示下一个要放字符的位置，所以初始化为1，每次取出一个，一开始t1是1的话就说明开始坐标恰好在应该放的位置，所以len-t1=0从头开始，如果坐标t1超过了len就加‘a’字符，然后从len-t1开始到这个字符串的结束，从len-t1开始是避免重复加，使前面已经有的字符就不在加了，第一个没有的就对应了len位置。

code:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1e6+100;
string s[maxn];
vector<pair<int,int> >tmp;
int main(){
    int n,k,x;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        cin >> s[i] >> k;
        for(int j = 0; j < k; j++){
            scanf("%d",&x);
            tmp.push_back(make_pair(x,i));
        }
    }
    sort(tmp.begin(),tmp.end());
    string ans;
    int len = 1;
    for(int i = 0; i < tmp.size(); i++){
        int t1 = tmp[i].first,t2 = tmp[i].second;
        while(t1 > len){
            ans += 'a';
            len++;
        }
        for(int j = len-t1; j < s[t2].length(); j++){
            ans += s[t2][j];
            len++;
        }
    }
    cout << ans << endl;
    return 0;
}