char s[N];
int a[N][N],n,p,ans[N];

void Gauss()
{
    int i,j,k,t;
    for(i=1,j=1;i<=n&&j<=n;i++,j++)
    {
        for(k=j;k<=n;k++) if(a[k][i]) break;
        for(t=1;t<=n+1;t++) swap(a[k][i],a[j][i]);
        for(k=1;k<=n;k++) if(k!=j&&a[k][i])
        {
            int x=a[j][i],y=a[k][i];
            for(t=1;t<=n+1;t++)
            {
                a[j][t]=a[j][t]*y%p;
                a[k][t]=a[k][t]*x%p;
                a[k][t]-=a[j][t];
                a[k][t]%=p;
                if(a[k][t]<0) a[k][t]+=p;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=0;j<p;j++) if(a[i][i]*j%p==a[i][n+1]) break;
        ans[i]=j;
    }
}

int main()
{
    rush()
    {
        RD(p); RD(s+1); n=strlen(s+1);
        int i,j;
        FOR1(i,n)
        {
            int k=1;
            FOR1(j,n) a[i][j]=k,k=k*i%p;
            a[i][n+1]=s[i]=='*'?0:s[i]-'a'+1;
        }
        Gauss();
        for(i=1;i<n;i++) printf("%d ",ans[i]);
        PR(ans[i]);
    }
}