Problem: In the year 2500 the annual graduation ceremony in the German University in Cairo (GUC) has run smoothly for almost 500 years so far.

The most important part of the ceremony is related to the arrangement of the professors in the ceremonial hall.

Traditionally GUC has n professors. Each professor has his seniority level. All seniorities are different. Let's enumerate the professors from 1 to n, with 1 being the most senior professor and n being the most junior professor.

The ceremonial hall has n seats, one seat for each professor. Some places in this hall are meant for more senior professors than the others. More specifically, m pairs of seats are in "senior-junior" relation, and the tradition requires that for all m pairs of seats (ai, bi) the professor seated in "senior" position ai should be more senior than the professor seated in "junior" position bi.

GUC is very strict about its traditions, which have been carefully observed starting from year 2001. The tradition requires that: 

  * The seating of the professors changes every year. 
  * Year 2001 ceremony was using lexicographically first arrangement of professors in the ceremonial hall. 
  * Each consecutive year lexicographically next arrangement of the professors is used. 



The arrangement of the professors is the list of n integers, where the first integer is the seniority of the professor seated in position number one, the second integer is the seniority of the professor seated in position number two, etc.

Given n, the number of professors, y, the current year and m pairs of restrictions, output the arrangement of the professors for this year.

Input

The first line contains three integers n, y and m (1 ≤ n ≤ 16, 2001 ≤ y ≤ 1018, 0 ≤ m ≤ 100) — the number of professors, the year for which the arrangement should be computed, and the number of pairs of seats for which the seniority relation should be kept, respectively.

The next m lines contain one pair of integers each, "ai bi", indicating that professor on the ai-th seat is more senior than professor on the bi-th seat (1 ≤ ai, bi ≤ n, ai ≠ bi). Some pair may be listed more than once.

Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin stream (you may also use the %I64d specificator).

Output

Print the order in which the professors should be seated in the requested year.

If by this year the GUC would have ran out of arrangements, or the given "senior-junior" relation are contradictory, print "The times have changed" (without quotes).

Examples

Input

3 2001 2
1 2
2 3


Output

1 2 3


Input

7 2020 6
1 2
1 3
2 4
2 5
3 6
3 7


Output

1 2 3 7 4 6 5


Input

10 3630801 0


Output

The times have changed


Input

3 2001 3
1 2
2 3
3 1


Output

The times have changed

Note

In the first example the lexicographically first order of seating is 1 2 3.

In the third example the GUC will run out of arrangements after the year 3630800.

In the fourth example there are no valid arrangements for the seating.

The lexicographical comparison of arrangements is performed by the < operator in modern programming languages. The arrangement a is lexicographically less that the arrangement b, if there exists such i (1 ≤ i ≤ n), that ai < bi, and for any j (1 ≤ j < i) aj = bj.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        long[][] dp;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            long y = in.nextLong() - 2000;
            int m = in.nextInt();

            final String noSolution = "The times have changed";

            boolean[][] graph = new boolean[n][n];
            for (int i = 0; i < m; ++i) {
                int x = in.nextInt() - 1, t = in.nextInt() - 1;
                graph[x][t] = true;
            }

            boolean[][] accesible = new boolean[n][n];
            for (int i = 0; i < n; ++i) {
                dfs(graph, accesible[i], i);
            }

            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    if (i != j && accesible[i][j] && accesible[j][i]) {
                        out.println(noSolution);
                        return;
                    }
                }
            }

            int[] g = new int[n];
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    if (accesible[i][j])
                        g[i] |= 1 << j;
                }
            }

            dp = new long[n + 1][1 << n];
            int[] pos = new int[n];
            Arrays.fill(pos, -1);

            if (count(pos, g) < y) {
                out.println(noSolution);
                return;
            }

            int[] fans = new int[n];
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    if (pos[j] != -1) continue;

                    pos[j] = i;
                    long x = count(pos, g);
                    if (x < y) {
                        y -= x;
                    } else {
                        fans[i] = j;
                        break;
                    }
                    pos[j] = -1;
                }
            }

            for (int i = 0; i < n; ++i)
                out.print((fans[i] + 1) + " ");
            out.println();
        }

        private void dfs(boolean[][] graph, boolean[] accesible, int node) {
            accesible[node] = true;
            for (int i = 0; i < graph.length; ++i) {
                if (graph[node][i] && !accesible[i]) {
                    dfs(graph, accesible, i);
                }
            }
        }

        private long count(int[] pos, int[] g) {
            int n = pos.length;
            int used = 0;
            for (int i = 0; i < n; ++i) {
                if (pos[i] != -1)
                    used |= 1 << pos[i];
            }
            for (long[] p : dp) {
                Arrays.fill(p, 0);
            }
            dp[0][0] = 1;
            for (int i = 0; i < n; ++i) {
                for (int conf = 0; conf < 1 << n; ++conf) {
                    if (dp[i][conf] == 0) continue;
                    for (int j = 0; j < n; ++j) {
                        if ((conf & g[j]) != 0) continue;
                        if ((pos[i] == -1 && (used & (1 << j)) == 0) ||
                                pos[i] == j) {
                            dp[i + 1][conf | (1 << j)] += dp[i][conf];
                        }
                    }
                }
            }
            return dp[n][(1 << n) - 1];
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}