/************************************************
Grundlegende Algorithmen mit Java,
http://algorithmen-und-problemloesungen.de/
Copyright @2007-2008 by Doina Logofatu
************************************************/

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

public class P04QSort {
  private static final String FileInputName = "QSort.in";
  private static final String FileOutputName = "QSort.out";

  private static void quickSort(int[] arr, int inf, int sup) {
    if (inf < sup) {
      int pivot = arr[inf], aux;
      int i = inf + 1, j = sup;
      while (i <= j) {
        while (i <= sup && arr[i] <= pivot)
          i++;
        while (j >= inf && arr[j] > pivot)
          j--;
        if (i < j && i <= sup && j >= inf) {
          aux = arr[i];
          arr[i] = arr[j];
          arr[j] = aux;
          i++;
          j--;
        }
      }
      i--;
      arr[inf] = arr[i];
      arr[i] = pivot;
      quickSort(arr, inf, i - 1);
      quickSort(arr, i + 1, sup);
    }
  }

  public static void main(String[] args) throws IOException {
    Scanner sc = null;
    PrintStream out = null;
    try {
      out = new PrintStream(new File(FileOutputName));
      sc = new Scanner(new File(FileInputName));
      List<Integer> list = new ArrayList<Integer>();
      while (sc.hasNextInt()) {
        list.add(sc.nextInt());        
      }
      int idx = list.size();
      int arr[] = new int[idx];
      for(int i=0; i<idx; i++)
        arr[i] = list.get(i);
      quickSort(arr, 0, idx - 1);
      for (int i = 0; i < idx; i++) {
        out.print(arr[i]);
        out.print(' ');
      }
    } finally {
      if (sc != null) {
        sc.close();
      }
      if (out != null) {
        out.close();
      }
    }
  }
}