#![allow(non_snake_case)] #[allow(unused_imports)] use crate::{arraylist::List, scanner::Scanner}; fn main() { let ret = calc(); println!("{}", ret.join("\n")); } fn calc() -> List { let mut scan = Scanner::new(); let n = scan.int(); let m = scan.long(); let mut k = scan.long(); let mut ret = list![]; let mut x = (n - 1) as i64; for _ in 0..n { if k >= x { ret.push(x); k -= x; x -= 1; } else { ret.push(k); let mut j = 0; if k == 0 { j += 1; } while ret.len() < n { ret.push(j); j += 1; if k == j { j += 1; } } break; } } let s = ret.sum(); let d = (m - s) / n as i64; let u = (m - s) as isize % n; let (_sorted, _trace, inv_trace) = ret.sort_and_trace(); for i in 0..u { ret[inv_trace[n - 1 - i]] += 1; } ret.map(|x| x + d) } pub mod types { pub use crate::arraylist::List as Seq; #[allow(non_camel_case_types)] pub type idx = isize; pub use crate::list as seq; pub use std::collections::hash_map as map; pub use std::collections::HashMap as Map; } pub mod scanner { use std::io::{stdin, BufReader, Bytes, Read, Stdin}; use crate::types::*; use std::str::FromStr; pub struct Scanner { buf: Bytes>, } impl Scanner { pub fn new() -> Scanner { Scanner { buf: BufReader::new(stdin()).bytes(), } } #[inline] fn token>(&mut self) -> T { self.buf .by_ref() .map(|c| c.unwrap() as char) .skip_while(|c| c.is_whitespace()) .take_while(|c| !c.is_whitespace()) .collect() } #[inline] pub fn read(&mut self) -> T { self.string().parse().ok().unwrap() } #[inline] pub fn string(&mut self) -> String { self.token() } #[inline] pub fn int(&mut self) -> idx { self.read() } #[inline] pub fn long(&mut self) -> i64 { self.read() } } } pub mod arraylist { use std::ops::*; use std::slice::Iter; use std::fmt::Formatter; use std::iter::FromIterator; use crate::independent::integer::Num; #[derive(Clone, PartialEq, Eq, PartialOrd, Ord)] pub struct List { pub data: Vec, } impl List { #[inline] pub fn new() -> List { List { data: vec![] } } #[inline] pub fn init(init: T, n: isize) -> List where T: Clone, { List { data: vec![init; n as usize], } } #[inline] pub fn push(&mut self, item: T) { self.data.push(item); } } macro_rules! impl_idx { ($($tpe:ty, $t:ident [$($output:tt)+], $slf:ident, $index:ident, $f:expr),*) => { $(impl<$t> Index<$tpe> for List<$t> { type Output = $($output)+; #[inline] fn index(&$slf, $index: $tpe) -> &Self::Output {$f} })* $(impl<$t> Index<$tpe> for lst<$t> { type Output = $($output)+; #[inline] fn index(&$slf, $index: $tpe) -> &Self::Output {$f} })* } } macro_rules! impl_idx_mut { ($($tpe:ty, $slf:ident, $index:ident, $f:expr),*) => { $(impl IndexMut<$tpe> for List { #[inline] fn index_mut(&mut $slf, $index: $tpe) -> &mut Self::Output {$f} })* $(impl IndexMut<$tpe> for lst { #[inline] fn index_mut(&mut $slf, $index: $tpe) -> &mut Self::Output {$f} })* }; } macro_rules! impl_idx_slice { ($($tpe:ty),*) => { impl_idx!($($tpe, T [lst], self, i, self.as_slice(i)),*); impl_idx_mut!($($tpe, self, i, self.as_slice_mut(i)),*); }; } impl_idx! { isize, T [T], self, i, self.at(i), char, T [T], self, i, self.at(i as isize - 'a' as isize) } impl_idx_slice! { Range, RangeTo, RangeFrom, RangeFull, RangeInclusive, RangeToInclusive } impl_idx_mut! { isize, self, i, self.at_mut(i), char, self, i, self.at_mut(i as isize - 'a' as isize) } impl FromIterator for List { #[inline] fn from_iter>(iter: U) -> Self { List { data: iter.into_iter().collect(), } } } impl IntoIterator for List { type Item = T; type IntoIter = std::vec::IntoIter; #[inline] fn into_iter(self) -> std::vec::IntoIter { self.data.into_iter() } } macro_rules! impl_traits { ($($tpe:tt),*) => { $( impl std::fmt::Display for $tpe { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { write!(f, "{}", self.iter().map(|x| format!("{}", x)).collect::>().join(" ")) } } impl std::fmt::Debug for $tpe { fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result { self.data.fmt(f) } } impl<'a, T> IntoIterator for &'a $tpe { type Item = &'a T; type IntoIter = Iter<'a, T>; #[inline] fn into_iter(self) -> Iter<'a, T> { self.iter() } } )* }; } impl_traits!(List, lst); impl From> for List { #[inline] fn from(vec: Vec) -> Self { List { data: vec } } } impl From<&[T]> for List { #[inline] fn from(slice: &[T]) -> Self { slice.iter().cloned().collect() } } impl Deref for List { type Target = lst; #[inline] fn deref(&self) -> &lst { lst::new(&self.data) } } impl DerefMut for List { #[inline] fn deref_mut(&mut self) -> &mut lst { lst::new_mut(&mut self.data) } } #[macro_export] macro_rules! list { () => { $crate::arraylist::List::new() }; ($($v:expr),+ $(,)?) => { $crate::arraylist::List::from([$($v),+].to_vec()) }; ($v:expr; $a:expr) => { $crate::arraylist::List::init($v, $a)}; ($v:expr; $a:expr; $($rest:expr);+) => { $crate::arraylist::List::init(list!($v; $($rest);+), $a) }; } #[allow(non_camel_case_types)] #[derive(PartialEq, Eq, PartialOrd, Ord)] #[repr(transparent)] pub struct lst { data: [T], } impl lst { #[inline] pub fn new(slice: &[T]) -> &Self { unsafe { &*(slice as *const [T] as *const Self) } } #[inline] pub fn new_mut(slice: &mut [T]) -> &mut Self { unsafe { &mut *(slice as *mut [T] as *mut Self) } } #[inline] pub fn len(&self) -> isize { self.data.len() as isize } #[inline] pub fn lens(&self) -> isize { self.data.len() as isize } #[inline] fn at(&self, index: isize) -> &T { if cfg!(debug_assertions) { self.data.index(index as usize) } else { unsafe { self.data.get_unchecked(index as usize) } } } #[inline] fn at_mut(&mut self, index: isize) -> &mut T { if cfg!(debug_assertions) { self.data.index_mut(index as usize) } else { unsafe { self.data.get_unchecked_mut(index as usize) } } } #[inline] pub fn as_slice(&self, range: impl RangeBounds) -> &lst { if cfg!(debug_assertions) { lst::new(self.data.index(self.rgm(range))) } else { unsafe { lst::new(self.data.get_unchecked(self.rgm(range))) } } } #[inline] pub fn as_slice_mut(&mut self, range: impl RangeBounds) -> &mut lst { if cfg!(debug_assertions) { lst::new_mut(self.data.index_mut(self.rgm(range))) } else { let r = self.rgm(range); unsafe { lst::new_mut(self.data.get_unchecked_mut(r)) } } } #[inline] pub fn cloned(&self) -> std::iter::Cloned> where T: Clone, { self.iter().cloned() } #[inline] pub fn join(&self, sep: &str) -> String where T: std::fmt::Display, { self.iter() .map(|x| format!("{}", x)) .collect::>() .join(sep) } #[inline] pub fn map(&self, f: F) -> List where T: Clone, F: FnMut(T) -> B, { self.cloned().map(f).collect() } #[inline] pub fn sum(&self) -> T where T: Num, { self.cloned().fold(T::zero(), |acc, x| acc + x) } #[inline] pub fn enumerate(&self) -> List<(isize, T)> where T: Clone, { self.cloned() .enumerate() .map(|p| (p.0 as isize, p.1)) .collect() } #[inline] fn rgm(&self, r: impl RangeBounds) -> Range { (match r.start_bound() { Bound::Included(x) => *x as usize, Bound::Excluded(x) => *x as usize + 1, _ => 0, }) .max(0)..(match r.end_bound() { Bound::Included(x) => *x as usize + 1, Bound::Excluded(x) => *x as usize, _ => self.data.len(), }) .min(self.data.len()) } #[inline] pub fn sort_and_trace(&self) -> (List, List, List) where T: Clone + Ord, { let mut ea = self.enumerate(); ea.sort_by(|(_, x), (_, y)| x.cmp(y)); let inv_trace = ea.map(|t| t.0); let trace = inv_trace.inverse(self.lens()); let sorted = ea.map(|t| t.1); (sorted, trace, inv_trace) } } impl lst { #[inline] pub fn inverse(&self, exclusive_ub: isize) -> List { let mut inv = List::init(0, exclusive_ub); for i in 0..self.lens() { inv[self[i]] = i; } inv } } impl Deref for lst { type Target = [T]; #[inline] fn deref(&self) -> &[T] { &self.data } } impl DerefMut for lst { #[inline] fn deref_mut(&mut self) -> &mut [T] { &mut self.data } } impl<'a, T> From<&'a [T]> for &'a lst { #[inline] fn from(slice: &'a [T]) -> Self { lst::new(slice) } } } pub mod independent { pub mod integer { use std::fmt::Debug; use std::fmt::Display; use std::ops::*; pub trait Num: Add + Sub + Mul + Div + AddAssign + SubAssign + MulAssign + DivAssign + PartialEq + PartialOrd + Copy + Debug + Display { fn to_u32(&self) -> u32; fn to_u64(&self) -> u64; fn to_u128(&self) -> u128; fn to_i32(&self) -> i32; fn to_i64(&self) -> i64; fn to_i128(&self) -> i128; fn to_usize(&self) -> usize; fn to_isize(&self) -> isize; fn to_f64(&self) -> f64; fn from_i32(x: i32) -> Self; fn from_u32(x: u32) -> Self; fn from_u64(x: u64) -> Self; fn from_u128(x: u128) -> Self; fn from_i64(x: i64) -> Self; fn from_i128(x: i128) -> Self; fn from_usize(x: usize) -> Self; fn from_isize(x: isize) -> Self; fn from_f64(x: f64) -> Self; fn zero() -> Self; fn one() -> Self; fn approx_sign(self) -> i32; fn approx_eq(self, other: Self) -> bool { (self - other).approx_sign() == 0 } } pub trait Int: Num + Rem + RemAssign + Ord { fn powint(&self, n: i64) -> Self; fn cmul(&self, b: Self) -> Option; } pub trait Float: Num {} #[macro_export] macro_rules! impl_num_functions { ($to_op:expr, $from_op:expr, $appx_op:expr) => { impl_num_functions!( $to_op, $from_op, to_u32, from_u32, u32, to_u64, from_u64, u64, to_u128, from_u128, u128, to_i32, from_i32, i32, to_i64, from_i64, i64, to_i128, from_i128, i128, to_usize, from_usize, usize, to_isize, from_isize, isize, to_f64, from_f64, f64 ); fn approx_sign(self) -> i32 {($appx_op)(self)} }; ($to_op:expr, $from_op:expr, $($tofn:ident, $fromfn:ident, $tpe:ident),*) => { $( fn $tofn(&self) -> $tpe { $to_op(self) as $tpe } fn $fromfn(x: $tpe) -> Self { $from_op(x) } )* fn zero() -> Self {$from_op(0)} fn one() -> Self {$from_op(1)} }; } macro_rules! impl_num_int { ($($tpe:ident),*) => { $( impl Num for $tpe { impl_num_functions!( |s: &Self| *s, |x| x as $tpe, |s: Self| if s < Self::zero() {-1} else if s > Self::zero() {1} else {0} ); } impl Int for $tpe { fn powint(&self, n: i64) -> Self { self.pow(n as u32) as $tpe } fn cmul(&self, b: Self) -> Option {self.checked_mul(b)} } )* }; } impl_num_int!(u8, u16, u32, u64, u128, i8, i16, i32, i64, i128, usize, isize); pub const EPS: f64 = 1e-6; impl Num for f64 { impl_num_functions!(|s: &Self| *s, |x| x as f64, |s: Self| if s < -EPS { -1 } else if s > EPS { 1 } else { 0 }); } impl Float for f64 {} } }