#include <iostream>
#include <cmath>
using namespace std;

int cnt = 0;

int n, k;
void dfs (int prev, int len){
	if (len == n) {
		return void(++cnt);
	}
	for (int i = 0; i < 10; ++i){
		if (!i && !len) continue;
		if (abs(i - prev) >= k){
			dfs(i, len + 1);
		}
	}
}

int main (int argc, char *argv[]){
	while (cin >> n >> k){
		dfs(-99999, 0);
		cout << cnt << endl;
		cnt = 0;
	}
}