#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 605#define maxl 305int n, m;char st[maxl], word[maxn][maxl];int f[maxl];int match(char*st1, char*st2){ if (st1[0] != st2[0]) return 0; int len = strlen(st2); int j =0; for (int i =0; i < len; i++) { while (st1[j] !=' '&& st1[j] != st2[i]) j++; if (st1[j] ==' ') return 0; j++; } return j;}int main(){ scanf("%d%d", &n, &m); scanf("%s", st); int num; for (int i =0; i < n; i++) scanf("%s", word[i]); f[m] =0; for (int i = m -1; i >=0; i--) { f[i] = f[i +1] +1; for (int j =0; j < n; j++) if (num = match(&st[i], word[j])) f[i] = min(f[i], int(num - strlen(word[j]) + f[i + num])); } printf("%dn", f[0]); return 0;}
