#include <bits/stdc++.h>
using namespace std;
#define int long long
int fix(int x, int y){
	x%=y;
	x+=y;
	x%=y;
	return x;
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,d,c;
	cin >> n >> d >> c;
	int cur = 1;
	if(d==0){
		if(c==n){
			cout << "Yes\n";
			for(int i = 0; i<n; i++){
				cout << '\n';
			}
		}
		else{
			cout << "No\n";
		}
		return 0;
	}
	if(d==1){
		if(c*2 == n){
			cout << "Yes\n";
			for(int i = 1; i<=n; i++){
				if(i%2==1)cout << i+1 << '\n';
				else cout << i-1 << '\n';
			}
			return 0;
		}
		else{
			cout << "No\n";
			return 0;
		}
	}
	if(d%2==1 && n%2==1){
		cout << "No\n";
		return 0;
	}
	if((d+1)*c>n){
		cout << "No\n";
		return 0;
	}
	vector<vector<int>>ans(n+1);
	while(c>1){
		if(cur+d>n){
			cout << "No\n";
			return 0;
		}
		for(int i = cur; i<=cur+d; i++){
			for(int j = cur; j<=cur+d; j++){
				if(i==j)continue;
				ans[i].push_back(j);
			}
		}
		c--;
		cur+=d+1;
	}

	int rem = n-cur+1;
	if(d%2==1&&rem%2==1){
		cout << "No\n";
		return 0;
	}
	if(rem<=d){
		cout << "No\n";
		return 0;
	}
	if(d%2==1){
		for(int i = 0; i<rem/2; i++){
			ans[i+cur].push_back(i+cur+rem/2);
			ans[i+cur+rem/2].push_back(i+cur);
		}
	}
	for(int i = 1; i<=d/2; i++){
		for(int j = 0; j<rem; j++){
			ans[j+cur].push_back(fix(j+i,rem)+cur);
			ans[fix(j+i,rem)+cur].push_back(j+cur);
		}
	}
	cout << "Yes\n";
	for(int i = 1; i<=n; i++){
		sort(ans[i].begin(),ans[i].end());
		for(int j = 0; j<d; j++){
			cout << ans[i][j];
			if(j+1<d)cout << ' ';
		}
		cout << '\n';
	}
	

	return 0;
}