#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const double eps=1e-5;
int end[2000];
double f[2000][2000];
int g[2000][2000];
int fail[2000];
int tr[2000][10];
int cnt;
double val[2000];
char ch[2000];
char s[2000];
int now;
int n,m;
int v;
double ans;
void build(char *ch,int v)
{int len=strlen(ch);now=0;for(int i=0;i<len;i++){int x=ch[i]-'0';if(!tr[now][x]){tr[now][x]=++cnt;}now=tr[now][x];}end[now]++;val[now]+=log(v);
}
void get_fail()
{queue<int>q;for(int i=0;i<=9;i++){if(tr[0][i]){q.push(tr[0][i]);}}while(!q.empty()){now=q.front();q.pop();val[now]+=val[fail[now]];end[now]+=end[fail[now]];for(int i=0;i<=9;i++){if(tr[now][i]){fail[tr[now][i]]=tr[fail[now]][i];q.push(tr[now][i]);}else{tr[now][i]=tr[fail[now]][i];}}}
}
double DP(double mid)
{for(int i=0;i<=n;i++){for(int j=0;j<=cnt;j++){f[i][j]=-1e9;g[i][j]=0;}}f[0][0]=0;for(int i=0;i<n;i++){for(int j=0;j<=cnt;j++){if(f[i][j]>-1e9){if(s[i+1]=='.'){for(int k=0;k<=9;k++){if(f[i+1][tr[j][k]]<f[i][j]+val[tr[j][k]]-mid*end[tr[j][k]]){f[i+1][tr[j][k]]=f[i][j]+val[tr[j][k]]-mid*end[tr[j][k]];g[i+1][tr[j][k]]=j;}}}else{int x=s[i+1]-'0';if(f[i+1][tr[j][x]]<f[i][j]+val[tr[j][x]]-mid*end[tr[j][x]]){f[i+1][tr[j][x]]=f[i][j]+val[tr[j][x]]-mid*end[tr[j][x]];g[i+1][tr[j][x]]=j;}}}}}double res=-1e9;for(int i=0;i<=cnt;i++){res=max(res,f[n][i]);}return res;
}
void print(int dep,int now)
{if(!dep){return ;}print(dep-1,g[dep][now]);if(s[dep]!='.'){printf("%c",s[dep]);return ;}else{for(int i=0;i<=9;i++){if(tr[g[dep][now]][i]==now){printf("%c",i+'0');return ;}}}
}
int main()
{scanf("%d%d",&n,&m);scanf("%s",s+1);for(int i=1;i<=m;i++){scanf("%s%d",ch,&v);build(ch,v);}get_fail();double l=0,r=22;while(r-l>eps){double mid=(l+r)/2;if(DP(mid)>0){l=mid;ans=mid;}else{r=mid;}}DP(ans);for(int i=0;i<=cnt;i++){if(f[n][i]>0){print(n,i);break;}}
}