分糖果

#include <unordered_map>
#include <iostream>
#include <vector> 
#include <bitset>
#include <algorithm>
int res = 0;
int f(int apple, int plate){
	if(plate > apple) return f(apple, apple);
 	if(apple == 0) return 1;
 	if(plate == 0) return 0;
	return  f(apple, plate - 1) + f(apple - plate, plate); //全部爲空+至少一個盤子爲空 
}
using namespace std;
int main(){
	int m, n;
	scanf("%d,%d", &m, &n);
	cout<<f(m, n)<<endl;
	return 0;
}