#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for (int i=0; i<n; ++i)
void solve() {
int n,m; cin>>n>>m;
if (n>5) return;
vector<int>s;
forn(i,2*n) s.push_back(i+1);
int steps=0;
int ans=0;
//next_permutation(s.begin(), s.end());
int need=1;
bitset<6> a[5];
forn(i,2*n) need*=i+1;
while (need--) {
++steps;
int paiu=1;
forn(i,5) a[i].reset();
forn(i,2*n) {
if (a[i%m][s[i]%n]) paiu=0;
a[i%m].set(s[i]%n);
}
ans+=paiu;
next_permutation(s.begin(), s.end());
}
cout<<ans;
//cout<<" !"<<steps;
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
}
