#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define For(i,j,k) for(int i=j;i>=k;--i)
#define mid (l+r>>1)
#define lson (x<<1)
#define rson (x<<1|1)
#define int long long
const int N = 2e5 + 111;
vector<int> e[N];
void sol(){
	int n,d,c;
	cin>>n>>d>>c;
	if(d==0){
		if(n==c){
			cout<<"Yes\n";
			FOR(i,1,n) cout<<'\n';
			return;
		}
		else{
			cout<<"No";
			return;
		}
	}
	if((d+1)*c>n){
		cout<<"No";
		return;
	}
	if(d%2==0){
		int m = n-(d+1)*(c-1);
		FOR(i,0,m-1){
			FOR(j,1,d/2){
				e[i+1].push_back((i+j)%m+1);
				e[(i+j)%m+1].push_back(i+1);
			}
		}
		FOR(k,1,c-1){
			int now = (k-1)*(d+1)+m+1;
			FOR(i,0,d){
				FOR(j,1,d/2){
					e[i+now].push_back((i+j)%(d+1)+now);
					e[(i+j)%(d+1)+now].push_back(i+now);
				}
			}
		}
		FOR(i,1,n) sort(e[i].begin(),e[i].end());
		cout<<"Yes\n";
		FOR(i,1,n){
			for(auto num:e[i]){
				cout<<num<<' ';
			}
			cout<<'\n';
		}
	}
	else{
		if(n%2==1){
			cout<<"No";
			return;
		}
		else{
			if(d==1){
				if(n!=c*2){
					cout<<"No\n";
					return;
				} 
				else{
					FOR(i,1,n/2){
						e[i*2-1].push_back(i*2);
						e[i*2].push_back(i*2-1);
					}
				}
			}
			else{
				int m = n-(d+1)*(c-1);
				FOR(i,0,m-1){
					FOR(j,1,d/2){
						e[i+1].push_back((i+j)%m+1);
						e[(i+j)%m+1].push_back(i+1);
					}
				}
				FOR(i,1,m/2){
					e[i].push_back(i+m/2);
					e[i+m/2].push_back(i);
				}
				FOR(k,1,c-1){
					int now = (k-1)*(d+1)+m+1;
					FOR(i,0,d){
						FOR(j,0,d){
							if(i!=j){
								e[i+now].push_back(j+now);
							}
						}
					}
				}
			}
			FOR(i,1,n) sort(e[i].begin(),e[i].end());
			cout<<"Yes\n";
			FOR(i,1,n){
				for(auto num:e[i]){
					cout<<num<<' ';
				}
				cout<<'\n';
			}
		}
	}
}
signed main()
{
    std::cin.tie(0);
    std::cin.sync_with_stdio(0);
    int t=1;
    while(t--){
    	sol();
	}
    return 0;
}
/*
16 0 16 
*/