void reverse(int p[],int n)
{
  int i;
  int u;

  for (i = 0;i < n;++i)
    if (i < n - 1 - i) { /* swap p[i] with p[n-1-i] */
      u = p[i];
      p[i] = p[n - 1 - i];
      p[n - 1 - i] = u;
    }
}

/* The rest of this program is an example of using reverse(). */

#include <stdio.h>

void print(int p[],int n)
{
  int i;

  for (i = 0;i < n;++i)
    printf("%d ",p[i]);
  printf("\n");
}

int main(void)
{
  int x[1000];
  int xlen = 0;
  int n;

  while (scanf("%d",&n) == 1)
    if (xlen < 1000)
      x[xlen++] = n;
      /* x[xlen++] = n means x[xlen] = n followed by ++xlen */
      /* x[++xlen] = n means ++xlen followed by x[xlen] = n */

  print(x,xlen);
  reverse(x,xlen);
  print(x,xlen);
  reverse(x,xlen);
  print(x,xlen);

  return 0;
}