def sort(a, b)
  if a > b
    t = a
    a = b
    b = t
  end
  a, b
end

n = gets.chomp.split(" ").map &:to_i

n.length.times{|i|
  n[0..-1-i].length.times { |j|
    break if j == n.length-i-1
    n[j, 2] = sort(n[j, 2])
  }
}

puts "#{n[0]} #{n[1]} #{n[2]}"