kmp——Youhane Assembler
#include<bits/stdc++.h>
using namespace std;
const int N = 300005;
string f[N],s;
int nxt[N];
void getNext()
{
int slen=s.length();
int j=0;
int k=-1;
nxt[0]=-1;
while(j<slen){
if(k==-1||s[j]==s[k]){
++k;
++j;
nxt[j]=k;
}
else{
k=nxt[k];
}
}
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>f[i];
}
int q;
cin>>q;
while(q--){
int a,b;
cin>>a>>b;
s=f[b]+'*'+f[a];
getNext();
int len=s.length();
cout<<nxt[len]<<endl;
}
return 0;
}