#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
int read()
{char c;int s=0,t=1;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
/*------------------------------------------------------------*/
const int inf=0x3f3f3f3f,maxn=101000,MOD=1000000007;int n;
char s[maxn],ans[maxn],nows[maxn];
int main()
{int T;scanf("%d",&T);while(T--){scanf("%s",s+1);int n=strlen(s+1);int nowstep=0,len=0,tot=0;for(int i=1;i<=n;i++)if(isdigit(s[i])){if(nowstep==1){nows[++len]=s[i];}else if(nowstep==2){for(int j=1;j<=s[i]-'0';j++){for(int k=1;k<=len;k++){ans[++tot]=nows[k];}}len=0;nowstep=0;}elseif(nowstep==0)ans[++tot]=s[i];}else{if(nowstep==0&&s[i]=='(')nowstep=1;elseif(nowstep==1&&s[i]==')')nowstep=2;}long long ansnum=0;for(int i=1;i<=tot;i++)ansnum=(ansnum*10+ans[i]-'0')%MOD;printf("%lld\n",ansnum);}return 0;
}

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
int read()
{char c;int s=0,t=1;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
/*------------------------------------------------------------*/
const int inf=0x3f3f3f3f,maxn=40,maxk=80010;int n,f[2][maxk],c,k,m,hi[maxn];
bool map[maxn][maxn],high[maxn];
void dfs(int dep,int now,int pre,int cyc,int x){if(dep==3){f[now][c]=max(f[now][c],f[pre][cyc]+1);}else{for(int i=0;i<=k-1;i++)if(map[x][hi[i+1]]&&!(c&(1<<i))){c|=(1<<i);dfs(dep+1,now,pre,cyc,x);c^=(1<<i);}}
}
int main()
{int T;scanf("%d",&T);while(T--){n=read();m=read();k=read();int u,v;memset(map,0,sizeof(map));for(int i=1;i<=m;i++){u=read();v=read();map[u][v]=map[v][u]=1;}memset(high,0,sizeof(high));for(int i=1;i<=k;i++){u=read();high[u]=1;}int nowk=0;for(int i=1;i<=n;i++)if(high[i])hi[++nowk]=i;k=nowk;memset(f,0,sizeof(f));int x=1;for(int i=1;i<=n;i++)if(!high[i]){x=1-x;memset(f[x],0,sizeof(f[x]));for(int j=0;j<(1<<k);j++){f[x][j]=max(f[x][j],f[1-x][j]);c=j;dfs(1,x,1-x,j,i);}}int ans=0;for(int i=0;i<(1<<k);i++)ans=max(ans,f[x][i]);printf("%d\n",ans);}return 0;
}