#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(kbrni,n)cout<<" "<<a[kbrni];cout<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define svecp(v) cout<<#v<<":";each(kbrni,v)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

bool dp[5001][(1 << 12)];

struct RollingHash {
	static const ll mo0=1000000007,mo1=1000000009; static ll mul0,mul1;
	static const ll add0=1000010007,add1=1003333331; static vector<ll> pmo[2];
	string s; int sz; vector<ll> hash_[2];
	void init(string s) {
		this->s=s; sz=(int)s.size();
		hash_[0].resize(sz+1,0),hash_[1].resize(sz+1,0);
		if(!mul0) mul0=10009+(((ll)&mul0)>>5)%259,mul1=10007+(((ll)&mul1)>>5)%257;
		if(pmo[0].empty()) pmo[0].pb(1),pmo[1].pb(1);
		rep(i,sz) hash_[0][i+1]=(hash_[0][i]*mul0+add0+s[i])%mo0;	//hash_[0][i]はインデックス0~i-1までの文字列のハッシュ値
		rep(i,sz) hash_[1][i+1]=(hash_[1][i]*mul1+add1+s[i])%mo1;
	}
	pair<ll,ll> hash(int l,int r) {	//文字列sのインデックス[l,r]の部分文字列のハッシュ値
		if(l>r) return make_pair(0,0);
		while((int)pmo[0].size()<r+2) pmo[0].pb(pmo[0].back()*mul0%mo0), pmo[1].pb(pmo[1].back()*mul1%mo1);
		return make_pair((hash_[0][r+1]+(mo0-hash_[0][l]*pmo[0][r+1-l]%mo0))%mo0,
			             (hash_[1][r+1]+(mo1-hash_[1][l]*pmo[1][r+1-l]%mo1))%mo1);
	}
	pair<ll,ll> hash(string s) { init(s); return hash(0,(int)s.size()-1); }	//文字列s全体のハッシュ値
	static pair<ll,ll> concat(pair<ll,ll> L,pair<ll,ll> R,int RL) { //文字列L+Rのハッシュ値,RLはRの文字列の長さ
		while((int)pmo[0].size()<RL+2) pmo[0].pb(pmo[0].back()*mul0%mo0), pmo[1].pb(pmo[1].back()*mul1%mo1);
		return make_pair((R.first + L.first*pmo[0][RL])%mo0,(R.second + L.second*pmo[1][RL])%mo1);
	}
};
vector<ll> RollingHash::pmo[2]; ll RollingHash::mul0,RollingHash::mul1;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(1){
        int n,m;
        cin >> n >> m;
        if(n == 0){
            break;
        }
        vs vec(n);
        vector<RollingHash> v(n);
        vector<pll> kp(n);
        rep(i,n){
            cin >> vec[i];
            kp[i] = v[i].hash(vec[i]);
        }
        RollingHash rh;
        string s;
        rep(i,m){
            string t;
            cin >> t;
            s += t;
        }
        rh.init(s);
        int ans = 0;
        rep(i,5001){
            rep(j,(1 << n)){
                dp[i][j] = false;
            }
        }
        int leng = len(s);
        rep(i,5001){
            dp[i][0] = true;
        }
        rep(i,leng+1){
            rep(j,(1 << n)-1){
                if(dp[i][j]){
                    rep(k,n){
                        if(!((j >> k) & 1)){
                            if(i+len(vec[k]) <= leng && kp[k] == rh.hash(i,i+len(vec[k])-1)){
                                dp[i+len(vec[k])][j|(1 << k)] = true;
                            }
                        }
                    }
                }
            }
            if(dp[i][(1 << n)-1]){
                ans++;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}



Measured memory_bytes: 23288