#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************



int nCr(int n, int r){
	if(r>n || r<0) return 0;
	
	//* Optimization 
	if(r > n-r) r = n-r;
	
	int res = 1;
	for(int i=1; i<=r; i++){
		res *= (n-r+i);
		res /= i;
	}
	
	return res;
}

int consistency(int m, int n){

	return nCr(m+n-2, m-1);

}















int practice(int m, int n){


    return 0;
}





void solve() {
    
    int m, n;
    cin>> m >> n;
    
    
    cout << consistency(m, n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}