1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
import java.util.*;
class Solution {


    static ArrayList<Integer> arr = new ArrayList<Integer>();
    static int cnt = 0;
    static boolean[] check;
    public static void dfs(int[] answer, int n, long k){


        if(arr.size() == n){
            cnt++;
            if(cnt == k){
                for(int i = 0 ; i < arr.size(); i++){
                    answer[i]= arr.get(i);
                }
            }
        }
        else{
            for(int i = 1; i <=n; i++){
                if(check[i] == false){
                    check[i] = true;
                    arr.add(i);
                    dfs(answer, n,k);
                    arr.remove(arr.size() - 1);
                    check[i] = false;
                }
            }
        }

    }

  public int[] solution(int n, long k) {


      int[] answer = new int[n];
      ArrayList<Integer> arr = new ArrayList<Integer>();
      check = new boolean[20];
      dfs(answer , n , k);
      return answer;
  }
}