#include<iostream>
#include<cstdio>
using namespace std;
int n,m,flag,x1,y1,x2,y2,fx;
int a[2010][2010][2],b[2010][2],cnt,p[2010],sum;
char s[2010][2010];
void dfs(int x){p[++sum]=x;for(int i=1;i<=a[x][0][0];i++){int num=0;int x3=a[x][i][0],y3=a[x][i][1];fx=(s[x3][y3-1]=='|'?1:-1);flag=0;while(!flag){while(s[x3][y3]=='-'){y3+=fx;}while(s[x3][y3]=='|'){x3++;}if(s[x3][y3]=='+'){if(s[x3-1][y3]=='|'){if(s[x3][y3-1]=='-'){fx=-1;y3=y3-1;}else{fx=1;y3=y3+1;}}else{x3++;}}else flag=1;}int x4=x3,y4=y3;while(s[x4][y4]!='+'){y4--;}int y5=y3;while(s[x4][y5]!='+'){y5++;}for(int k=x3+1;k<=n;k++){for(int l=y4+1;l<=y5-1;l++){if('0'<=s[k][l]&&s[k][l]<='9'){int l1=l;num=s[k][l]-'0';while('0'<=s[k][l1+1]&&s[k][l1+1]<='9'){num*=10;num+=s[k][l1+1]-'0';l1++;}break;}}if(num)break;}dfs(num);}
}
int main()
{
//    freopen("2.in","r",stdin);
//    freopen("2.out","w",stdout);scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){scanf("%s",s[i]+1);}for(int i=1;i<=n;i++){flag=0;for(int j=1;j<=m;j++){if(s[i][j]=='+'){if(!flag&&s[i][j+1]=='-'){x1=i,y1=j;flag=1;}else if(flag&&s[i][j+1]=='-'){x1=i,y1=j;flag=1;} else if(s[i][j+1]!='-'&&flag){cnt=0;x2=i,y2=j;flag=0;while(s[x1+1][y1]=='|'&&s[x1+1][y2]=='|'){x1++;x2++;if(s[x1][y1-1]=='-'){b[++cnt][0]=x1;b[cnt][1]=y1-1;}if(s[x2][y2+1]=='-'){b[++cnt][0]=x2;b[cnt][1]=y2+1;}}if(x1!=i){for(int k=i+1;k<=x1;k++){for(int l=y1+1;l<=y2-1;l++){if('0'<=s[k][l]&&s[k][l]<='9'){int l1=l;int num=0;num=s[k][l]-'0';while('0'<=s[k][l1+1]&&s[k][l1+1]<='9'){num*=10;num+=s[k][l1+1]-'0';l1++;}for(int k=1;k<=cnt;k++){a[num][k][0]=b[k][0];a[num][k][1]=b[k][1];a[num][0][0]++;}//        printf("  %d\n",num);break;}}}}}}}}dfs(1);for(int i=sum;i>=1;i--){printf("%d\n",p[i]);}return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,k,m,maxt;
int f[110][110][2010],g[110][110][2010],begin,ans;
struct node{int a,b,t;
}c[110];
bool cmp(node a,node b){if(a.a<b.a)return true;else return false;
}
int main(){scanf("%d%d%d",&n,&k,&m);for(int i=1;i<=m;i++){scanf("%d%d%d",&c[i].a,&c[i].b,&c[i].t);maxt=max(maxt,c[i].t);}c[0].a=k,c[0].b=0,c[0].t=1;sort(c,c+m+1,cmp);for(int i=0;i<=m;i++){if(c[i].a==k&&c[i].t==1){begin=i;break;}}memset(f,-63,sizeof(f));memset(g,-63,sizeof(g));f[begin][begin][1]=g[begin][begin][1]=0;for(int t=1;t<=maxt;t++){for(int i=begin;i>=0;i--){for(int j=begin;j<=m;j++){if(i>0){f[i-1][j][t+c[i].a-c[i-1].a]=max(f[i-1][j][t+c[i].a-c[i-1].a],f[i][j][t]+(c[i-1].t>=t+c[i].a-c[i-1].a?c[i-1].b:0));f[i-1][j][t+c[j].a-c[i-1].a]=max(f[i-1][j][t+c[j].a-c[i-1].a],g[i][j][t]+(c[i-1].t>=t+c[j].a-c[i-1].a?c[i-1].b:0));}if(j<m){g[i][j+1][t+c[j+1].a-c[j].a]=max(g[i][j+1][t+c[j+1].a-c[j].a],g[i][j][t]+(c[j+1].t>=t+c[j+1].a-c[j].a?c[j+1].b:0));g[i][j+1][t+c[j+1].a-c[i].a]=max(g[i][j+1][t+c[j+1].a-c[i].a],f[i][j][t]+(c[j+1].t>=t+c[j+1].a-c[i].a?c[j+1].b:0));}}}}for(int t=1;t<=maxt;t++){for(int i=begin;i>=0;i--){for(int j=begin;j<=m;j++){ans=max(f[i][j][t],ans);ans=max(g[i][j][t],ans);}}}printf("%d",ans);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#define M 5000010
#define N 8
#define ll long long
#define up(x,y) x=(x+(y))%mod
using namespace std;
const int mod=1000000007;
int n,m,K,w[M],p2[M][N],pw[M][N];
ll g[N],C[N][N],f[N],fac[N],ans;
char s[50010];
bool a[M];
ll ksm(ll a,ll b)
{ll r=1;for(;b;b>>=1,a=a*a%mod)if(b&1) r=r*a%mod;return r;
}
void find(int num,int v)
{if(v>n){ll c=1,cnt=0;for(int i=1;i<=num;i++)c=c*fac[f[i]-1]*((f[i]&1)?1:-1)%mod;for(int i=1;i<=num;i++)if(f[i]&1) cnt++;else c=c*w[1]%mod;up(ans,c*g[cnt]);   return ;}for(int i=1;i<=num+1;i++)f[i]++,find(max(num,i),v+1),f[i]--;
}
int main()
{scanf("%d%d%s",&n,&K,s+1);m=strlen(s+1);for(int i=0;i<K;i++)for(int j=1;j<=m;j++)a[i*m+j]=s[j]-'0';m*=K;for(int i=m,mi=1;i;i--,mi=(mi<<1)%mod)w[i]=(w[i+1]+mi*a[i])%mod;fac[0]=1;for(int i=1;i<=n;i++)fac[i]=fac[i-1]*i%mod;  C[0][0]=1;for(int i=1;i<=n;C[i][0]=1,i++)for(int j=1;j<=i;j++)C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;                        bool flag=0;g[0]=1;for(int i=0,tmp=1;i<=m+1;i++,tmp=(tmp<<1)%mod){p2[i][0]=pw[i][0]=1;for(int j=1;j<=n;j++)p2[i][j]=(ll)tmp*p2[i][j-1]%mod,pw[i][j]=(ll)w[i]*pw[i][j-1]%mod;}for(int i=1;i<=m;flag|=a[i],i++)if(a[i])for(int j=1;j<=n;j++)if(!flag||!(j&1))for(int k=0;k<=((j-1)>>1);k++)up(g[j],C[j][k<<1]*pw[i+1][k<<1]%mod*p2[m-i][j-(k<<1)-1]);find(0,1);printf("%lld",(ans+mod)*ksm(fac[n],mod-2)%mod);                 return 0;
}