#include <fstream>

using namespace std;

const int prim[] = {2, 3, 5};

int R, D;
int times[3], total; // 2, 3 sau 5 (ca divizori primi)

int main()
{
    ifstream fin("pascal.in");
    ofstream fout("pascal.out");

    fin >> R >> D;
    for (int i = 1; i < R; ++i)
    {
        // P[R][i] = R! / i! * (R - i)!, deci P[R][i] = P[R][i - 1] * (R - i + 1) / i

        int now1 = R - i + 1, now2 = i;
        for (int i = 0; i < 3; ++i)
        {
            while (now1 % prim[i] == 0)
                ++times[i], now1 /= prim[i];
            while (now2 % prim[i] == 0)
                --times[i], now2 /= prim[i];
        }

        if (D == 2 && times[0]) ++total;
        if (D == 3 && times[1]) ++total;
        if (D == 4 && times[0] >= 2) ++total;
        if (D == 5 && times[2]) ++total;
        if (D == 6 && times[0] && times[1]) ++total;
    }

    fout << total;

    fin.close();
    fout.close();
}