#include <iostream>
#include <cmath>
using namespace std;
 
int main() {
	int m, n,k;
	double l=1;
	int counter = 0;
	cin >> m >> n >>k;
	for (int i=1; i<=n; i++){
		if(counter) l=k*2-(counter-1); 
		if(l<2) counter=0; 
		for (int j=1; j<=m; j++){
			if(l>k*2){ 
				l=1;
			}
			cout <<  ceil(l/2) ;
			l++;
		}
		cout << endl;
		counter++;
	}
	return 0;
}