#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 210, M = 10;

int n, k;
int f[N][M][M];

int main()
{
	scanf("%d%d", &n, &k);
	
	f[0][0][0] = 1;
	for (int i = 1; i <= n; i ++ )
		for (int j = 1; j <= k; j ++ )
			for (int l = 0; l < 9; l ++ )
				for (int o = 0; o <= l; o ++ )
					f[i][j][l] += f[i - l][j - 1][o];
	
	int ans = 0;
	for (int i = 0; i < 9; i ++ )
		ans += f[n][k][i];
	
	printf("%d\n", ans);
	
	return 0;
}