#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define endl '\n'
#define pii pair<int ,int > 
#define ll long long 



const int N=1e5+10,M=2e6+10;

int tt;
int n,qq;

string s;

ll yijing;

ll num[30][30];

struct node
{
    ll jiewei;
    int nxt[27];
    ll sum;
}st[M];
int cnt=1;




int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);
   
    cin>>n>>qq;

    //
    //cout<<n<<" "<<qq<<endl;
   // exit(0);
    rep(i,1,n)
    {
        cin>>s;
        int lens=s.size();
        s=' '+s;
        int now=1;
        rep(j,1,lens)
        {
            yijing+=st[now].jiewei;
            int nxt=s[j]-'a'+1;
            rep(ii,1,26)
            {
                if(ii==nxt)
                {
                    continue;
                }
                num[ii][nxt]+=st[  st[now].nxt[ii] ].sum;

            }
            
            if(st[now].nxt[nxt]==0)
            {
                st[now].nxt[nxt]=++cnt;
            }
            now=st[now].nxt[nxt];
            st[now].sum++;
        }
        st[now].jiewei++;
    }
    while (qq--)
    {
        cin>>s;
        s=' '+s;
        ll ans=yijing;
        per(i,1,26)
        {
            rep(j,1,i-1)
            {
                ans+=num[    s[i] -'a'+1   ][s[j]-'a'+1];
            } 
        }
        cout<<ans<<endl;
    }
    



    return 0;
}