#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

int n,s;
int dp[10][1<<10][333];

int f(int now, int used, int sum){
    if(sum < 0)return 0;
    if(now == n)return sum == 0;
    if(dp[now][used][sum] != -1) return dp[now][used][sum];
    int ret = 0;
    rep(i,10)if(used & (1<<i)){
        ret += f(now+1, used&~(1<<i), sum-i*(now+1));
    }
    dp[now][used][sum] = ret;
    return ret;
}

signed main(void) {
    while(cin >> n >> s){
        rep(i,10)rep(j,1<<10)rep(k,333)dp[i][j][k] = -1;
        if(s <= 330)cout << f(0, (1<<10)-1, s) << endl;
        else cout << 0 << endl;
    }
}

