import java.util.*;
 
//update 2020/1/1 23:01
 
public class Main{
 
  static Scanner sc = new Scanner(System.in);
  static StringBuilder sb = new StringBuilder();
 
  public static void main(String[] args) {
 
	int[] aaa = new int[3];
    
    aaa[0] = nextInt();
    aaa[1] = nextInt();
    aaa[2] = nextInt();
 
    System.out.println(aaa[2]+" "+aaa[0]+" "+aaa[1]);
    
  }
  /*
    static String toSmall(String s){
      char c = s.charAt(0);
      //if(Character.isUpperCase(c)){
      if(c<=90){
        c += 32;
      }
      return String.valueOf(c);
    }
    static String toBig(String s){
      char c = s.charAt(0);
      //if(Character.isLowerCase(c)){
      if(c>=97){
        c -= 32;
      }
      return String.valueOf(c);
    }
  */
 
  static String toSmall(String s){
    return s.toLowerCase();
  }
 
  static String toBig(String s){
    return s.toUpperCase();
  }
 
  static String next(){
    return sc.next();
  }
 
  static int nextInt(){
    return Integer.parseInt(sc.next());
  }
 
  static long nextLong(){
    return Long.parseLong(sc.next());
  }
 
  static double nextDouble(){
    return Double.parseDouble(sc.next());
  }
 
  static String[] splitString(String s){
    return s.split("");
  }
 
  static char[] splitChar(String s){
    return s.toCharArray();
  }
 
  static int charToInt(char a){
    return a - 48;
  }
 
////////////////////////////////////////////
  public static int max(int[] a){
    int lng = a.length;
    int max = a[0];
    for(int i=1;i<lng;i++){
      max = Math.max(max,a[i]);
    }
    return max;
  }
  public static long max(long[] a){
    int lng = a.length;
    long max = a[0];
    for(int i=1;i<lng;i++){
      max = Math.max(max,a[i]);
    }
    return max;
  }
////////////////////////////////////////////
 
////////////////////////////////////////////
  public static int min(int[] a){
    int lng = a.length;
    int min = a[0];
    for(int i=1;i<lng;i++){
      min = Math.min(min,a[i]);
    }
    return min;
  }
  public static long min(long[] a){
    int lng = a.length;
    long min = a[0];
    for(int i=1;i<lng;i++){
      min = Math.min(min,a[i]);
    }
    return min;
  }
////////////////////////////////////////////
 
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz