import java.io.*;
import java.util.*;
import java.lang.String;
import java.util.Arrays;

import static java.lang.Integer.*;

public class Main extends PrintWriter {
    Main() { super(System.out, true); }
    Scanner sc = new Scanner(System.in);
    public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    }
    //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    }

    void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    }
} import java.io.*; io.* java import java.util.*; util.* java import java.lang.String; String java.lang import java.util.Arrays; Arrays java.util import static java.lang.Integer.*; import static java.lang.Integer.*; import static java.lang.Integer.*; public class Main extends PrintWriter {
    Main() { super(System.out, true); }
    Scanner sc = new Scanner(System.in);
    public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    }
    //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    }

    void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    }
} Main Scanner sc = new Scanner(System.in); sc new Scanner(System.in) Main() { super(System.out, true); } Main { super(System.out, true); } super(System.out, true) super System.out System System.out true public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    } main {
        Main o = new Main(); o.main(); o.flush();
    } Main o = new Main(); o new Main() o.main() o.main o o.flush() o.flush o String[] $ $ //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    } binSearch {
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    } int left=0 left 0 right=arr.length-1 right arr.length-1 arr.length arr arr.length 1 mid=(left+right)/2 mid (left+right)/2 (left+right) left right 2 ind=0; ind 0 while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        } left<=right left right {
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        } if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1; arr[mid]<=number arr[mid] arr mid number {
                ind=mid+1;
                left=mid+1;
            } ind=mid+1 ind mid+1 mid 1 left=mid+1 left mid+1 mid 1 right=mid-1 right mid-1 mid 1 mid=(left+right)/2 mid (left+right)/2 (left+right) left right 2 return ind; ind Integer[] arr arr int number number void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    } main {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    } int a = sc.nextInt(); a sc.nextInt() sc.nextInt sc int b = sc.nextInt(); b sc.nextInt() sc.nextInt sc int c = sc.nextInt(); c sc.nextInt() sc.nextInt sc print(c + " " + a + " " + b) print c + " " + a + " " + b " " a c + " " + a + " " + b c " " a " " b PrintWriter public class Main extends PrintWriter {
    Main() { super(System.out, true); }
    Scanner sc = new Scanner(System.in);
    public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    }
    //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    }

    void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    }
} public class Main extends PrintWriter {
    Main() { super(System.out, true); }
    Scanner sc = new Scanner(System.in);
    public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    }
    //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    }

    void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    }
} Main
import java.io.*;
import java.util.*;
import java.lang.String;
import java.util.Arrays;

import static java.lang.Integer.*;

public class Main extends PrintWriter {
    Main() { super(System.out, true); }
    Scanner sc = new Scanner(System.in);
    public static void main(String[] $) {
        Main o = new Main(); o.main(); o.flush();
    }
    //took bsearch from Dukkha
    private static int binSearch(Integer[] arr, int number){
        int left=0,right=arr.length-1,mid=(left+right)/2,ind=0;
        while(left<=right){
            if(arr[mid]<=number){
                ind=mid+1;
                left=mid+1;
            }
            else
                right=mid-1;
            mid=(left+right)/2;
        }
        return ind;
    }

    void main() {

       int a = sc.nextInt();
       int b = sc.nextInt();
       int c = sc.nextInt();

       print(c + " " + a + " " + b);    

    }
}