#include "bits/stdc++.h" #define int long long using namespace std; using ll = long long; using P = pair; const ll INF = (1LL << 61); ll mod = 998244353; struct mint { ll x; // typedef long long ll; mint(ll x = 0) :x((x%mod + mod) % mod) {} mint operator-() const { return mint(-x); } mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res += a; } mint operator-(const mint a) const { mint res(*this); return res -= a; } mint operator*(const mint a) const { mint res(*this); return res *= a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod - 2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res /= a; } }; istream& operator>>(istream& is, mint& a) { return is >> a.x; } ostream& operator<<(ostream& os, const mint& a) { return os << a.x; } signed main() { ios::sync_with_stdio(false); cin.tie(0); int N, M, K; cin >> N >> M >> K; if (N == 1) { cout << 0 << endl; return 0; } int a = M - (N - 1) * (N - 2) / 2; int now = 0; for (int i = N - 1; i >= 0; i--) { if (now + i >= K) { int cnt = K - now; vectorv(N); int t = N - 1; for (int j = 0; j < N - 1 - i; j++) { v[j] = t; t--; } t = 0; for (int j = N - 1 - i; j < N; j++) { v[j] = t; t++; } t = N - 1; for (int j = 0; j < cnt; j++) { swap(v[t], v[t - 1]); t--; } for (int j = 0; j < N; j++) { if (v[j] == N - 1)cout << a; else cout << v[j]; cout << endl; }return 0; } } return 0; }