#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int l1,l2,f[N];
char s1[N],s2[N];
int z[N],p;
int main()
{scanf("%s%s",s1+1,s2+1);l1=strlen(s1+1),l2=strlen(s2+1);int j=0;for(int i=2;i<=l2;i++){while(j&&s2[i]!=s2[j+1])j=f[j];if(s2[i]==s2[j+1])j++;f[i]=j;}j=0;for(int i=1;i<=l1;i++){while(j&&s1[i]!=s2[j+1])j=f[j];if(s1[i]==s2[j+1])j++;if(j==l2){z[++p]=i-l2+1;j=f[j];}}for(int i=1;i<=p;i++)printf("%d\n",z[i]);for(int i=1;i<=l2;i++)printf("%d ",f[i]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n;
char s[N],t[N],fw[N];
int l1,l2,f[N];
int main()
{scanf("%d",&n);n--;scanf("%s",s+1);l1=strlen(s+1);while(n--){scanf("%s",t+1);l2=strlen(t+1);for(int i=1;i<=l2;i++)f[i]=0;int j=0;for(int i=2;i<=l2;i++){while(j&&t[i]!=t[j+1])j=f[j];if(t[i]==t[j+1])j++;f[i]=j;}j=0;for(int i=l1-l2+1;i<=l1;i++){while(j&&s[i]!=t[j+1])j=f[j];if(s[i]==t[j+1])j++;if(l2==j&&i!=l1)j=f[j];}//printf("(%d)\n",j);for(int i=j+1;i<=l2;i++)s[++l1]=t[i];}for(int i=1;i<=l1;i++)printf("%c",s[i]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int pos[N];
int l1,l2,f[N],z[N],p;
char s[N],t[N];
int main()
{scanf("%s%s",s+1,t+1);l1=strlen(s+1),l2=strlen(t+1);int j=0;for(int i=2;i<=l2;i++){while(j&&t[i]!=t[j+1])j=f[j];if(t[i]==t[j+1])j++;f[i]=j;}j=0;for(int i=1;i<=l1;i++){while(j&&s[i]!=t[j+1])j=f[j];if(s[i]==t[j+1])j++;z[++p]=i;pos[i]=j;if(j==l2)j=pos[z[p-=l2]];}for(int i=1;i<=p;i++)printf("%c",s[z[i]]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n;
long long ans;
char s[N];
int f[N],fa[N];
int main()
{scanf("%d%s",&n,s+1);int j=0;for(int i=2;i<=n;i++){while(j&&s[i]!=s[j+1])j=f[j];if(s[i]==s[j+1])j++;f[i]=j;int pre=f[i];while(fa[pre])pre=fa[pre];fa[i]=pre;if(pre)ans+=i-pre;//,printf("[%d]%d\n",i,i-pre);}printf("%lld\n",ans);
}

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
const ll mod=1e9+7;
int l1,f[N],num[N];
char s[N];
int main()
{int T;scanf("%d",&T);while(T--){ll tmp=1;scanf("%s",s+1);l1=strlen(s+1);int j=0;num[1]=1;for(int i=2;i<=l1;i++){while(j&&s[i]!=s[j+1])j=f[j];if(s[i]==s[j+1])j++;f[i]=j;num[i]=num[f[i]]+1;//printf("[%d]%d,%d\n",i,num[i],f[i]);}j=0;for(int i=2;i<=l1;i++){while(j&&s[i]!=s[j+1])j=f[j];if(s[i]==s[j+1])j++;if(j*2>i)j=f[j];tmp=tmp*(num[j]+1)%mod;}printf("%lld\n",tmp);}
}

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int n,m;
int t[N][30],all;
bool g[N],f[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}g[p]=1;
}
void work(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now]){printf("WRONG\n");return ;}p=t[p][now];}if(!g[p])printf("WRONG\n");else{if(!f[p])f[p]=1,printf("OK\n");else	printf("REPEAT\n");}
}
char s[N];
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);putin(s);}scanf("%d",&m);for(int i=1;i<=m;i++){scanf("%s",s);work(s);}
}

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int t[N][30],all=1;
int f[N],las[N];
int val[N],sam[N];
void putin(char *s,int bt)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}if(!val[p])val[p]=bt;else sam[bt]=val[p];
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];las[p]=val[f[p]]?f[p]:las[f[p]];}}
}
int ans[N];
void work(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';p=t[p][now];int pre=0;pre=val[p]?p:las[p];while(pre){ans[val[pre]]++;pre=las[pre];}}
}
int n;
char s[N];
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);putin(s,i);}get_fail();scanf("%s",s);work(s);for(int i=1;i<=n;i++){if(sam[i])printf("%d\n",ans[sam[i]]);else	  printf("%d\n",ans[i]);}
}

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int t[N][30],all;
int dep[N],f[N],val[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all,dep[t[p][now]]=dep[p]+1;p=t[p][now];}val[p]=1;
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}}
}
int z[N],z_p;
int pos[N];
void work(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';p=t[p][now];z[++z_p]=i;pos[i]=p;if(val[p]){p=pos[z[z_p-=dep[p]]];}}
}
int n;
char s[N],st[N];
int main()
{scanf("%s",st);scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);putin(s);}get_fail();work(st);for(int i=1;i<=z_p;i++)printf("%c",st[z[i]]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int t[N][30],all;
int f[N],las[N];
int val[N],sam[N];
void putin(char *s,int bt)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}if(!val[p])val[p]=bt;else	   sam[bt]=val[p];
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<=26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<=26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];las[p]=val[f[p]]?f[p]:las[f[p]];}}
}
int ans[N];
void work(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';p=t[p][now];int pre=val[p]?p:las[p];while(pre){ans[val[pre]]++;pre=las[pre];}}
}
int n,len=-1;
char s[N],st[N];
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);putin(s,i);for(int j=0;s[j];j++)st[++len]=s[j];st[++len]=26+'a';}get_fail();work(st);for(int i=1;i<=n;i++)if(!sam[i])printf("%d\n",ans[i]);else	   printf("%d\n",ans[sam[i]]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=5e2+10,K=1e3+10;
int t[N][5],all;
int f[N],val[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'A';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]++;
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<3;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<3;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}val[u]+=val[f[u]];}
}
int n,k;
char s[20];
int dp[K][N];
int main()
{scanf("%d%d",&n,&k);for(int i=1;i<=n;i++){scanf("%s",s);putin(s);}get_fail();memset(dp,-0x3f,sizeof(dp));dp[0][0]=0;for(int i=1;i<=k;i++)for(int p=0;p<=all;p++)for(int j=0;j<3;j++)dp[i][t[p][j]]=max(dp[i][t[p][j]],dp[i-1][p]+val[t[p][j]]);int ans=0;for(int i=0;i<=all;i++)ans=max(ans,dp[k][i]);printf("%d",ans);
}

#include<bits/stdc++.h>
using namespace std;
const int N=6e3+10,K=105,mod=1e4+7;
int t[N][30],all;
int f[N];bool val[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'A';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]=1;
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}val[u]|=val[f[u]];}
}
int n,k;
int dp[K][N][2];
char s[N];
int main()
{scanf("%d%d",&n,&k);for(int i=1;i<=n;i++){scanf("%s",s);putin(s);}get_fail();dp[0][0][0]=1;for(int i=1;i<=k;i++)for(int p=0;p<=all;p++)for(int j=0;j<26;j++){int u=t[p][j];if(val[u]){dp[i][u][1]+=dp[i-1][p][1]+dp[i-1][p][0];dp[i][u][1]%=mod;}else{dp[i][u][1]+=dp[i-1][p][1];dp[i][u][1]%=mod;dp[i][u][0]+=dp[i-1][p][0];dp[i][u][0]%=mod;}}int ans=0;for(int p=0;p<=all;p++)ans+=dp[k][p][1],ans%=mod;printf("%d\n",ans);
}

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3e3+10,K=2e3+10;
const ll mod=1e9+7;
int t[N][10],all;
int f[N];bool val[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'0';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]=1;
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<10;i++)if(t[p][i])q.push(t[p][i]);//else	   q.push(t[p][i]=++all);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<10;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}val[u]|=val[f[u]];}t[0][0]=0;
}
int n;
int dp[N][K][2];
char s[N],st[N];
int main()
{scanf("%s",st);int len=strlen(st);scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);putin(s);}get_fail();
//	for(int i=0;i<=all;i++,printf("\n"))
//	for(int j=0;j<10;j++)printf("%d ",t[i][j]);dp[0][0][1]=1;for(int i=1;i<=len;i++){int up=st[i-1]-'0';for(int p=0;p<=all;p++){for(int j=0;j<10;j++){int v=t[p][j];if(val[v])continue;dp[i][v][0]+=dp[i-1][p][0],dp[i][v][0]%=mod;}for(int j=0;j<=up;j++){int v=t[p][j];if(val[v])continue;dp[i][v][j==up?1:0]+=dp[i-1][p][1],dp[i][v][j==up?1:0]%=mod;}}		}ll ans=mod-1;for(int i=0;i<=all;i++)ans=(ans+dp[len][i][0]+dp[len][i][1])%mod;printf("%lld",ans);
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10,M=2*N;
int head[N],nex[M],to[M],tot;
void build(int u,int v){tot++;nex[tot]=head[u];to[tot]=v;head[u]=tot;}int n;
//--
int t[N][30],all;
int fa[N],f[N],val[N];
int g,id[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(s[i]=='B'){p=fa[p];}else if(s[i]=='P'){val[p]++;id[++g]=p;}else{if(!t[p][now])t[p][now]=++all,fa[t[p][now]]=p;p=t[p][now];}}
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}build(u,f[u]);build(f[u],u);}
}
int dfn[N],sz[N],cnt;
void dfs(int u)
{dfn[u]=++cnt;sz[u]=1;//printf("[%d,%d]\n",u,cnt);for(int i=head[u];i;i=nex[i]){int v=to[i];if(dfn[v])continue;dfs(v);sz[u]+=sz[v];}
}
int T[N],key;
int lowbit(int x){return x&(-x);}
void add(int i){for(;i<=cnt;i+=lowbit(i))T[i]+=key;}
int qur(int i){int tmp=0;for(;i;i-=lowbit(i))tmp+=T[i];return tmp;}
//--
struct qus{int x,y,id;friend bool operator<(const qus a,const qus b){return a.x<b.x;}
}bt[N];
int ans[N];
char s[N];
int main()
{scanf("%s",s);putin(s);get_fail();dfs(0);scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d%d",&bt[i].y,&bt[i].x),bt[i].id=i;sort(bt+1,bt+n+1);int p1=0,p2=1,p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(s[i]=='B'){key=-1;add(dfn[p]);p=fa[p];}else if(s[i]=='P'){p1++;while(bt[p2].x==p1){int u=id[bt[p2].y];ans[bt[p2].id]=qur(dfn[u]+sz[u]-1)-qur(dfn[u]-1);//printf("\n---%d[(%d)%d-%d]=%d\n",bt[p2].id,u,dfn[u],dfn[u]+sz[u]-1,ans[bt[p2].id]);//printf("---%d,%d\n",qur(dfn[u]+sz[u]-1),qur(dfn[u]));p2++;}}else{p=t[p][now];key=1;add(dfn[p]);}//printf("\n[%d]%c\n",p,s[i]);//for(int j=1;j<=all;j++)printf("%d ",qur(j)-qur(j-1));}for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10,M=2*N,K=1e5+10;
int head[N],nex[M],to[M],tot;
void build(int u,int v){tot++;nex[tot]=head[u];to[tot]=v;head[u]=tot;}
int t[N][30],all=1;
int f[N],val[N];
int putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]=1;return p;
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}build(u,f[u]);build(f[u],u);}
}
//--
int T[N],key;
int lowbit(int x){return x&(-x);}
void add(int i){for(;i<=all;i+=lowbit(i))T[i]+=key;}
int qur(int i){int tmp=0;for(;i;i-=lowbit(i))tmp+=T[i];return tmp;}
//--
//---
int n,q;
int id[K];
int sz[N],dfn[N],cnt;
void dfs(int u)
{dfn[u]=++cnt;sz[u]=1;for(int i=head[u];i;i=nex[i]){int v=to[i];if(dfn[v])continue;dfs(v);sz[u]+=sz[v];}//if(val[u])key=1,add(1,1,all,dfn[u],dfn[u]+sz[u]-1);if(val[u]){key= 1;add(dfn[u]);key=-1;add(dfn[u]+sz[u]);}
}
int work(char *s)
{int p=0,ans=0;for(int i=1;s[i];i++){int now=s[i]-'a';p=t[p][now];//ans+=qur(1,1,all,dfn[p]);ans+=qur(dfn[p]);}return ans;
}
//--
int num(char *s)
{int ans=0;for(int i=1;s[i];i++)ans=ans*10+s[i]-'0';return ans;
}
int ccnt[N];
char s[N];
int main()
{scanf("%d%d",&q,&n);for(int i=1;i<=n;i++){scanf("%s",s);//printf("%s\n",s);id[i]=putin(s);ccnt[i]=1;}get_fail();dfs(0);while(q--){scanf("%s",s);if(s[0]=='?')printf("%d\n",work(s));else if(s[0]=='+'){int u=num(s);if(ccnt[u])continue;ccnt[u]++;u=id[u];//key= 1,add(1,1,all,dfn[is],dfn[is]+sz[is]-1);key= 1;add(dfn[u]);key=-1;add(dfn[u]+sz[u]);}else if(s[0]=='-'){int u=num(s);if(!ccnt[u])continue;ccnt[u]--;u=id[u];//key=-1,add(1,1,all,dfn[is],dfn[is]+sz[is]-1);key=-1;add(dfn[u]);key= 1;add(dfn[u]+sz[u]);}}
}

#include<bits/stdc++.h>
#define re register
using namespace std;
const int N=1e6+10,M=2*N;
int n,q;
int head[N],nex[M],to[M],tot;
void build(int u,int v){tot++;nex[tot]=head[u];to[tot]=v;head[u]=tot;}
//---
int id[N];
int t[N][30],all;
int f[N],val[N];
int sam[N],bl[N],dep[N];
inline int putin(char *s,int p,int bto=0)
{for(re int i=0;s[i];++i){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}if(bto){if(!bl[p])bl[p]=bto;else	  sam[bto]=bl[p];val[p]=1;		}return p;
}
inline void get_fail()
{queue<int>q;int p=0;for(re int i=0;i<26;++i)if(t[p][i])q.push(t[p][i]),dep[t[p][i]]=dep[p]+1;while(!q.empty()){int u=q.front();q.pop();for(re int i=0;i<26;++i){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];dep[p]=dep[u]+1;}build(u,f[u]);build(f[u],u);}
}
//--
int dfn[N],sz[N],cnt;
inline void dfs(int u)
{dfn[u]=++cnt,sz[u]=1;for(re int i=head[u];i;i=nex[i]){int v=to[i];if(dfn[v])continue;dfs(v);sz[u]+=sz[v];}
}
//---
int T[N],key;
inline int lowbit(int x){return x&(-x);}
inline void add(int i){for(;i<=cnt;i+=lowbit(i))T[i]+=key;}
inline int qur(int i){int tmp=0;for(;i;i-=lowbit(i))tmp+=T[i];return tmp;}
//----
struct qus{int x,y,id;friend bool operator<(const qus a,const qus b){return a.x<b.x;}
}bt[N];
int res[N];
char s[N];int fr[N];
inline void DFS(int p)
{key= 1;add(dfn[p]);if(bl[p]){int pre=fr[bl[p]];while(bt[pre].x==bl[p]){int is=bt[pre].y;res[bt[pre].id]=qur(dfn[is]+sz[is]-1)-qur(dfn[is]-1);pre++;}}//printf("[%d]->",p);for(re int i=0;i<26;++i){int v=t[p][i];if(dep[v]<=dep[p])continue;DFS(v);}key=-1;add(dfn[p]);
}
int main()
{scanf("%d",&n);for(re int op,x,i=1;i<=n;++i){scanf("%d",&op);if(op==1){scanf("%s",s);id[i]=putin(s,0,i);}else{scanf("%d%s",&x,s);id[i]=putin(s,id[x],i);}}scanf("%d",&q);for(re int i=1;i<=q;++i){scanf("%d%s",&bt[i].x,s);bt[i].id=i;bt[i].y=putin(s,0);if(sam[bt[i].x])bt[i].x=sam[bt[i].x];}get_fail();dfs(0);sort(bt+1,bt+q+1);for(re int i=1;i<=q;++i)if(bt[i].x!=bt[i-1].x)fr[bt[i].x]=i;//printf("BUG");DFS(0);for(re int i=1;i<=q;++i)printf("%d\n",res[i]);
}

#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
int t[N][3],all;
int f[N];bool val[N];
void putin(char *s)
{int p=0;for(int i=0;s[i];i++){int now=s[i]-'0';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]=1;//printf("{%d}",p);
}
void get_fail()
{queue<int>q;int p=0;for(int i=0;i<=1;i++)if(t[p][i])q.push(t[p][i]);else 	   q.push(t[p][i]=++all);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<=1;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];}val[u]|=val[f[u]];}
}
int n;
char s[N];
bool vis[N],ex[N];
void dfs(int u)
{//printf("[%d]%d,%d->\n",u,vis[u],ex[u]);if(vis[u]){printf("TAK\n");exit(0);}if(val[u]||ex[u])return ;vis[u]=ex[u]=1;for(int i=0;i<=1;i++)if(t[u][i])dfs(t[u][i]);vis[u]=0;
}
int main()
{scanf("%d",&n);while(n--){scanf("%s",s);putin(s);}get_fail();dfs(0);printf("NIE");
}

//CF1202E You Are Given Some Strings...
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
struct ACM{int t[N][30],all;int f[N],las[N],val[N];long long res[N];void putin(char *s){int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';if(!t[p][now])t[p][now]=++all;p=t[p][now];}val[p]++;}void get_fail(){queue<int>q;int p=0;for(int i=0;i<26;i++)if(t[p][i])q.push(t[p][i]);while(!q.empty()){int u=q.front();q.pop();for(int i=0;i<26;i++){p=t[u][i];if(!p){t[u][i]=t[f[u]][i];continue;}q.push(p);int pre=f[u];while(pre&&!t[pre][i])pre=f[pre];f[p]=t[pre][i];las[p]=val[f[p]]?f[p]:las[f[p]];}}}void work(char *s){int p=0;for(int i=0;s[i];i++){int now=s[i]-'a';p=t[p][now];int pre=val[p]?p:las[p];while(pre){res[i]+=val[pre];pre=las[pre];}}}
}tr1,tr2;
int n;
char st[N],s[N];
int main()
{scanf("%s",st);scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s);tr1.putin(s);reverse(s,s+strlen(s));tr2.putin(s);}tr1.get_fail();tr2.get_fail();int len=strlen(st);tr1.work(st);reverse(st,st+len);tr2.work(st);long long ans=0;for(int i=0;i<len;i++)ans+=tr1.res[i]*tr2.res[len-i-2];//,printf("[%lld,%lld]\n",tr1.res[i],tr2.res[len-i-1]);printf("%lld",ans);
}