# include<iostream>

# include<cstdio>

# include<algorithm>

# include<cmath>

# include<cstring>

const int mn = ;

const int mod = ;

int n,m,ans;

int f[mn][mn][mn];

int main()

{

    scanf("%d%d",&n,&m);

    f[][][]=;

    for(int i=;i<n;i++)

        for(int j=;j<=m;j++)

            for(int k=;k+j<=m;k++)

            {

                f[i+][j][k]=(f[i+][j][k]+f[i][j][k])%mod;

                //什么都不放

                if(j>=)

                    f[i+][j-][k+]=(f[i+][j-][k+]+1ll*f[i][j][k]*j%mod)%mod;

                //在有跑的一行放一个跑

                if((m-k-j)>=)

                    f[i+][j+][k]=(f[i+][j+][k]+1ll*f[i][j][k]*(m-k-j)%mod)%mod;

                //在空地上放一个跑

                if(j>=)

                    f[i+][j-][k+]=(f[i+][j-][k+]+1ll*f[i][j][k]*(j-)*j/%mod)%mod;

                if((m-k-j)>=)

                    f[i+][j+][k]=(f[i+][j+][k]+1ll*f[i][j][k]*(m-k-j-)*(m-k-j)/%mod)%mod;

                if((m-k-j)>= && j>=)

                    f[i+][j][k+]=(f[i+][j][k+]+1ll*f[i][j][k]*(m-k-j)*j%mod)%mod;

            }

    for(int i=;i<=m;i++)

        for(int j=;j+i<=m;j++)

        ans=(ans+f[n][i][j])%mod;

    printf("%d",ans);

    return ;

}