import java.util.*;

public class Main {
    static int l,n;
    static int cnt;
    static int[] row = new int[6];
    static int[] col = new int[6];
    static int[][] map = new int[6][6];

    public static void dfs(int x,int y) { //搜到第x行，第y列
        if (x == n + 1 && y == 1) {
            cnt ++;
            return;
        }
        for (int i = 0;i <= 9;i ++) {
            row[x] += i;
            col[y] += i;
            if (row[x] > l || col[y] > l) {
                row[x] -= i;
                col[y] -= i;
                continue;
            }
            if (x == n) {
                if (col[y] != l) {
                    row[x] -= i;
                    col[y] -= i;
                    continue;
                } 
            }
            if (y == n) {
                if (row[x] != l) {
                    row[x] -= i;
                    col[y] -= i;
                    continue;
                }
                dfs(x+1,1);
            } else {
                dfs(x,y+1);
            }
            row[x] -= i;
            col[y] -= i;
        }
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        l = sc.nextInt();
        n = sc.nextInt();
        dfs(1,1);

        System.out.println(cnt);
    }
}

import java.util.*;

public class Main {
    static int l,n,sum;
    static int N = 6;
    static int[] row = new int[N];
    static int[] col = new int[N];
    static int cnt;

    public static void dfs(int i) {
        if (i == sum) {
            cnt ++;
            return;
        }
        int x = i / n;
        int y = i % n;
        for (int j = 0;j <= l;j ++) {
            row[x] += j;
            col[y] += j;
            if (row[x] > l || col[y] > l) {
                row[x] -= j;
                col[y] -= j;
                continue;
            }
            if (x == n - 1) {
                if (col[y] != l) {
                    row[x] -= j;
                    col[y] -= j;
                    continue;
                }
            }
            if (y == n - 1) {
                if (row[x] != l) {
                    row[x] -= j;
                    col[y] -= j;
                    continue;
                }
            }
            dfs(i + 1);
            row[x] -= j;
            col[y] -= j;
        }
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        l = sc.nextInt();
        n = sc.nextInt();
        sum = n * n;
        dfs(0);
        System.out.println(cnt);
    }
}