beton koto

#include<bits/stdc++.h>
using namespace std;
int main()
{
    vector<pair <string ,int> > v;
    int i,j,k,l,n,m,point;
    string s,str;
    cin>>n>>m;
    for(i=0;i<n;i++)
    {
        cin>>s>>k;
        v.push_back(make_pair(s,k));

    }
   cin.ignore();
   int cownt=0;

    for(int x = 1;x<=m;x++)
    {

   int cownt=0;
    while(1){
    getline(cin,str);
    point = str.find('.');
    if(point!= -1)
    {
                    break;
     }

    for(j=0;j<n;j++)
        {
            int len;
            len = v[j].first.length();
    for (int i=1;(l=str.find(v[j].first)) != -1 ;i++)
        {
               str.erase(l,len);

                 k = i;

        }
       // cout<<"Found = "<<v[j].first<<" "<<k<<" Times"<<endl;

       // cout<<endl;
         cownt = cownt+v[j].second*k;
        l=0;
        i = 0;
        k=0;
       // cout<<"sum  "<<cownt<<endl;
    }


    }    cout<<cownt<<endl;
    }
}