Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) C 并查集

C. String Reconstruction

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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
题意：n行 每行先给你一个字符串str 以及接下来的x位置 表示以某个位置开始的字符串部分为str 输出满足以上要求的字典序最小的字符串
题解：stl怼爆内存 这里用到了并查集 对于每个位置i的字符当确认之后 使得fa[i]=i+1 则不需要每次都遍历更新每个位置的字符 寻找其在范围内的fa即可

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define ll __int64
 using namespace std;
 int fa[];
 char ans[];
 int find(int x)
 {
     if(fa[x]==x)
         return x;
     else
         return fa[x]=find(fa[x]);
 }
 int n;
 char a[];
 int main()
 {
     scanf("%d",&n);
     int exm;
     int zong=;
     for(int i=;i<=;i++){
         ans[i]='a';
         fa[i]=i;
         }
     for(int i=; i<=n; i++){
         scanf("%s",a);
         int len=strlen(a);
         scanf("%d",&exm);
         for(int j=;j<=exm;j++){
             int ss;
             scanf("%d",&ss);
             int x=ss;
             zong=max(zong,ss+len-);
             while(x<=(ss+len-))
             {
                 ans[x]=a[x-ss];
                 fa[x]=x+;x=find(x);
             }
         }
     }
     for(int i=;i<=zong;i++)
         printf("%c",ans[i]);
     printf("\n");
     return ;
 }