70pts WA on#8~10求助

#include<bits/stdc++.h>
//hash版本 
using namespace std;
const int mod=1e9+7,base=131;
typedef unsigned long long ull;
struct node
{
	int id,point;
	ull h;
}a[100001];
ull hashe(string s)
{
	int len=s.size();
	ull ans=0;
	for(int i=0;i<len;i++)ans=(ans*base+ull(s[i]))%mod;
	return ans;
}
bool cmp(node a,node b)
{
	return a.h<b.h;
}
map<string,int>p; 
int n,pp,ans;
string s;
void work(string s)
{
	int len=s.size();
	for(int i=0;i<len;i++)
	{
		string now="";
		while(i<len&&(s[i]!='!'&&s[i]!='?'&&s[i]!=','&&s[i]!='.'&&s[i]!=' '))now+=s[i++];
		int l=1,r=n,pos,find=hashe(now);
		while(l<=r)
		{
			int mid=(l+r)>>1;
			if(a[mid].h<=find)pos=mid,l=mid+1;
			else r=mid-1;
		}
		if(a[pos].h==find)ans=(a[pos].point+ans)%pp;
	}
}
int main()
{
	cin>>n>>pp;
	for(int i=1;i<=n;i++)
	{
		string tmp;
		int point;
		cin>>tmp>>point;
		int cnt=hashe(tmp);
		a[i].id=i;
		a[i].point=point;
		a[i].h=cnt;
	}
	sort(a+1,a+n+1,cmp);
	while(getline(cin,s))
	{
		work(s);
	}
	cout<<ans%pp;
	return 0;
}