vars

package com.company.Recursion.problems;

import java.util.Scanner;

public class Variantions_NB {
    static int count;
    static int n;
    static int k;

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        n=input.nextInt();
        k=input.nextInt();

        int[] set=new int[n];
        int[] vars=new int[k];
        boolean[] used=new boolean[n];
        fillSet(set);
        genVariations(0,set,vars,used);

    }

    private static void genVariations(int index, int[] set, int[] result, boolean[]used){

        if(index==result.length){
                printVars(result);
        }
        else{

            for (int i = 0; i < result.length; i++) {
                if (!used[i]) {
                    used[i]=true;
                    result[index] = set[i];
                    genVariations(index + 1, set, result,used);
                    used[i]=false;
                }
            }
        }
    }

    private static void printVars(int[] set) {
        //
        for (int i = 0; i < set.length - 1; i++) {
            System.out.print(set[i] + " ");
        }
        System.out.println(set[set.length - 1]);
    }
    private static int[] fillSet(int[] set) {
        for (int index = 0; index <set.length ; index++) {
            set[index]=index+1;
        }
        return set;
    }
}