package main

import (
	"fmt"
	"strconv"
	"strings"
)

const nMax = 100000 // 10^5

func main() {
	var n, k, s int
	fmt.Scan(&n, &k, &s)

	w := make([]string, 0)
	c := 0
	aa := false
	for i := 0; len(w) < n; i++ {
		if c < k {
			t := s
			if nMax < t {
				for j := 0; j < t/nMax; j++ {
					w = append(w, strconv.Itoa(nMax))
				}
				if aa && t/nMax > 1 {
					w = w[:len(w)-1]
					aa = false
				} else {
					if aa && t%nMax == 0 {
						w = w[:len(w)-1]
						aa = false
					} else if t%nMax != 0 {
						w = append(w, strconv.Itoa(t%nMax))
						i++
					} else {
						aa = true
					}
				}
			} else {
				w = append(w, strconv.Itoa(t))
			}
		} else {
			t := s - 1
			if t+1 == s {
				t = nMax/2 - 3
			}
			if t < 0 {
				t = s + 1
			} else if nMax < t {
				t = 1
			}
			w = append(w, strconv.Itoa(t))
		}
		c++
	}

	fmt.Println(strings.Join(w, " "))
}
