import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        long m = sc.nextLong();
        long last = m - (long)(n - 1) * (n - 2) / 2;
        long k = sc.nextLong();
        long[] ans = new long[n];
        Arrays.fill(ans, -1L);
        int min = 0;
        int max = n - 1;
        BinaryIndexedTree bit = new BinaryIndexedTree(n + 1);
        for (int i = 0; i < n - 1; i++) {
            if (k == 0) {
                ans[min] = i;
                while (ans[min] >= 0) {
                    min++;
                }
            } else if (max - bit.getSum(max + 1) <= k) {
                k -= max - bit.getSum(max + 1);
                ans[max] = i;
                bit.add(max + 1, 1);
                while (ans[max] >= 0) {
                    max--;
                }
            } else {
                int left = min;
                int right = max;
                while (right - left > 1) {
                    int mm = (left + right) / 2;
                    if (mm - bit.getSum(mm + 1) <= k) {
                        left = mm;
                    } else {
                        right = mm;
                    }
                }
                ans[left] = i;
                bit.add(left, 1);
                while (ans[min] >= 0) {
                    min++;
                }
            }
        }
        ans[min] = last;
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            sb.append(ans[i]).append("\n");
        }
        System.out.print(sb);
    }
}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}