#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 10010

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int T,n,m,nxt[N],cnt[],mn[N*][<<],f[N*][<<],tree[<<][N<<],ans;

bool flag[];

char s[N],a[][N];

struct data

{

    int x,y,op;

    bool operator <(const data&a) const

    {

        return x<a.x;

    }

}b[][N],c[*N];

void dfs(int k,int last,int r,int s)

{

    if (k==m) {ans=max(ans,s);return;}

    for (int i=;i<=m;i++)

    if (!flag[i])

    {

        int u=,v=;

        for (int j=;j<=cnt[i];j++)

        if (b[i][j].x>=last)

            if (b[i][j].x<=r) u=j;

            else {v=j;break;}

        flag[i]=;

        if (u) dfs(k+,b[i][u].x,max(r,b[i][u].y),s+max(b[i][u].y-r,));

        if (v) dfs(k+,b[i][v].x,max(r,b[i][v].y),s+b[i][v].y-b[i][v].x+);

        flag[i]=;

    }

}

void rebuild()

{

    bool flag[]={};

    for (int i=;i<=m;i++)

        for (int j=;j<=m;j++)

        if (i!=j&&(strlen(a[i]+)<strlen(a[j]+)||(strlen(a[i]+)==strlen(a[j]+)&&i>j)))

        {

            for (int k=;k<=cnt[i];k++)

            if (b[i][k].x>=b[j][].x&&b[i][k].y<=b[j][].y) {flag[i]=;break;}

        }

    n=;int m2=;

    for (int i=;i<=m;i++)

    if (!flag[i])

    {

        for (int j=;j<=cnt[i];j++)

        c[++n]=b[i][j],c[n].op=m2;

        m2++;

    }

    m=m2;

    sort(c+,c+n+);

}

void ins(int op,int k,int l,int r,int p,int x)

{

    tree[op][k]=min(tree[op][k],x);

    if (l==r) return;

    int mid=l+r>>;

    if (p<=mid) ins(op,k<<,l,mid,p,x);

    else ins(op,k<<|,mid+,r,p,x);

}

int query(int op,int k,int l,int r,int x,int y)

{

    if (x>y) return N;

    if (l==x&&r==y) return tree[op][k];

    int mid=l+r>>;

    if (y<=mid) return query(op,k<<,l,mid,x,y);

    else if (x>mid) return query(op,k<<|,mid+,r,x,y);

    else return min(query(op,k<<,l,mid,x,mid),query(op,k<<|,mid+,r,mid+,y));

}

void work()

{

    memset(f,,sizeof(f));f[][]=;

    memset(mn,,sizeof(mn));mn[][]=;

    memset(tree,,sizeof(tree));

    int t=;

    for (int i=;i<=n;i++)

    {

        while (c[t+].y<c[i].x) t++;

        for (int j=;j<(<<m);j++)

        if (j&(<<c[i].op))    f[i][j]=min(mn[t][j^(<<c[i].op)]+c[i].y-c[i].x+,query(j^(<<c[i].op),,,n,t+,i-)+c[i].y);

        for (int j=;j<(<<m);j++)

        mn[i][j]=min(mn[i-][j],f[i][j]),ins(j,,,n,i,f[i][j]-c[i].y);

    }

    ans=mn[n][(<<m)-];

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj4560.in","r",stdin);

    freopen("bzoj4560.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    T=read();

    while (T--)

    {

        scanf("%s",s+);n=strlen(s+);

        m=read();

        for (int i=;i<=m;i++) scanf("%s",a[i]+);

        memset(cnt,,sizeof(cnt));

        for (int i=;i<=m;i++)

        {

            nxt[]=-;int t=strlen(a[i]+);

            for (int k=;k<=t;k++)

            {

                int j=nxt[k-];

                while (~j&&a[i][j+]!=a[i][k]) j=nxt[j];

                nxt[k]=j+;

            }

            int x=;

            for (int k=;k<=n;k++)

            {

                while (~x&&a[i][x+]!=s[k]) x=nxt[x];

                x++;if (x==t) cnt[i]++,b[i][cnt[i]].x=k-t+,b[i][cnt[i]].y=k,x=nxt[x];

            }

        }

        for (int i=;i<=m;i++) sort(b[i]+,b[i]+cnt[i]+);

        ans=;dfs(,,,);int tmp=ans;

        rebuild();work();

        cout<<ans<<' '<<max(ans,tmp)<<endl;

    }

    return ;

}