/*
   This code is from "Algorithms in C, Third Edition," 
   by Robert Sedgewick, Addison Wesley Longman, 1998." 
 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Nmax 1000000
#define Mmax 10000000
char buf[Mmax]; int M = 0;
int compare(void *i, void *j)
  { return strcmp(*(char **)i, *(char **)j); }
main()
  { int i, N;
    char* a[Nmax]; 
    for (N = 0; N < Nmax; N++)
      {
        a[N] = &buf[M];
        if (scanf("%s", a[N]) == EOF) break;
        M += strlen(a[N])+1;
      }
    qsort(a, N, sizeof(char*), compare);
    for (i = 0; i < N; i++) printf("%s\n", a[i]);
  }