#include <iostream>
#include <list>
using namespace std;

int findMin(list<int> &boxSizes) {
   list <int>::iterator lit;
   list <int>::iterator min;

   min = boxSizes.begin();
   for (lit = boxSizes.begin(); lit != boxSizes.end(); lit++) {
     if (*lit < *min) {
        min = lit;
     }
   }
   int returnValue = *min;
   boxSizes.erase(min);
   return returnValue;
}

int main(int argc, char **argv)
{
   list <int> lines;
   list <int>::iterator lit;
   int s;
   int i;

   for (i = 1; i < argc; i++) {
      s = atoi(argv[i]);
      lines.push_back(s);
   }

   cout << "sort the list\n";
   while (!lines.empty()) 
      cout << findMin(lines) << endl;

}