#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<array>
#include<random>
#include<string>
#include<time.h>
#include<cstring>
#include<set>
#include<cmath>
#include<queue>
#define int long long
#define endl '\n'
#define F first
#define S second
#define sz size()
#define ln cout<<'\n'
#define B begin()
#define pb push_back
#define D end()
#define pii pair<int,int> 

using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9;
int n, d, c;

void solve()
{
	cin >> n >> d >> c;
	vector<vector<int>> g(n + 1);
	if ((d + 1) * c > n ){
		cout << "No" << endl;
		return;
	}
	if (n != c && d == 0)
	{
		cout << "No" << endl;
		return;
	}
	if (n == c && d == 0)
	{
		cout << "Yes" << endl;
		return;
	}
	if (d == 1)
	{
		if (n != c * 2) {
			cout << "No" << endl;
			return;
		}
	}
	int k = n - (d + 1) * (c - 1);
	
	for (int i = 1; i < k; i++)
	{
		g[i].push_back(i % k + 1);
		g[i % k + 1].push_back(i);
	}
	int cnt;
	cnt = k;
	for (int i = 1; i <= k; i++)
	{
		while (g[i].size() < d)
		{
			if (cnt <= i+1)cnt = k;
			//cout << i << ' ' << cnt << endl;
			g[i].push_back(cnt);
			g[cnt].push_back(i);
			cnt--;
		}
	}
	for (int i = 1; i <= k; i++)
	{
		if (g[i].size() != d) {
			cout << "No" << endl;
			return;
		}
	}
	cout << "Yes" << endl;
	for (int i = 1; i <= k; i++)
	{
		sort(g[i].begin(), g[i].end());
		for (int v : g[i])cout << v << ' ';
		cout << endl;
	}

	for (int i = 1; i < c; i++)
	{
		for (int j = k + 1; j <= k + 1 + d; j++)
		{
			for (int kk = k+1; kk <= k + 1 + d; kk++)
			{
				if (kk == j)continue;
				else cout << kk << ' ';
			}
			cout << endl;
		}
		k =k+ d + 1;
	}
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int tc = 1;
	tc = 1;
	while (tc--)
	{
		solve();
	}
	//cout<<"dafc";
	return 0;
}