#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("costi.in");
ofstream fout("frunze.out");

const int mod = 29989;

int d[55][55];

int main(){
    int n, p;
    cin >> n >> p;
    d[3][2] = 3;
    for (int i = 3; i <= n; i++)
        for (int j = 2; j <= p && j < i; j++)
            if (i != 3 || j != 2)
            d[i][j] = ((j + i - 2) * d[i - 1][j] + (i - j) * d[i - 1][j - 1]) % mod;
    cout << d[n][p] << '\n';
    return 0;
}