/*
动态规划
*/
// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>
using namespace std;
// typedef
typedef __int64 LL;
//
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))
const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
if(x>y) return x;
return y;
}
template<class T> inline T TMIN(T x,T y)
{
if(x<y) return x;
return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
T t = x;
x = y;
y = t;
}
// code begin
int M,N;
int data[11][110],top[110],up[110];
char col[10][20];
bool DP[50010];
int getID(char *tar)
{
for(int i=0;i<M;i++)
{
if(strcmp(col[i],tar)==0)
return i;
}
return -1;
}
int main()
{
read;
write;
int tm,id;
char co[20];
while(scanf("%d %d",&M,&N)==2)
{
if(M+N==0) break;
for(int i=0;i<M;i++)scanf("%s",col[i]);
memset(top,0,sizeof(top));
memset(up,0,sizeof(up));
for(int i=0;i<N;i++)
{
scanf("%d %s",&tm,co);
id = getID(co);
up[id] += tm;
data[id][top[id]++]=tm;
}
int ans = 0;
for(int i=0;i<M;i++)
{
memset(DP,0,sizeof(DP));
DP[0]=1;
for(int j=0;j<top[i];j++)
{
//printf("%d ",data[i][j]);
for(int k=up[i]/2;k>=0;k--)
{
if(k-data[i][j]<0)break;
DP[k] |= DP[k-data[i][j]];
}
}
//printf("\n");
for(int j=up[i]/2;j>=0;j--)
{
if(DP[j])
{
ans+=up[i]-j;
break;
}
}
}
printf("%d\n",ans);
}
return 0;
}