/*****************************************
备注：
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int cnt, a[N];
void f(int step , int last , int m)
{
	if (m == 0)
	{
		for (int i = 0 ; i < step ; i++)
			cout << a[i] << " ";
		cnt++;
		cout << endl;
		return ;
	}
	for (int i = last ; i >= 1; i--)
	{
		a[step] = i;
		f(step + 1 , i - 1  , m - 1 );
	}
}
int main()
{
	int n , m;
	cin >> n >> m;
	f(0 , n , m);
	cout << cnt << endl;
	return 0;
}