#include <bits/stdc++.h>

using namespace std;

const int N = 10;

int ans[N];

int n, k;

void dfs(int x) {

if (x == n + 1) {

for (int i = 1; i <= n; i++)
	
  cout << ans[i] << " ";
	
cout << endl;
	
return ;

}

for (int i = 1; i <= k; i++) {

ans[x] = i;

dfs(x + 1);

}

}

int main() {

cin >> n >> k;

dfs(1);

return 0;

}