public long getNumber(int N, int K) {
		int p = 1;
		for (int i = 1; i <= N; i++) {
			p *= i;
		}

		int[] hit = new int[N];
		int[] list = new int[N];
		for (int i = 0; i < list.length; i++) {
			list[i] = i + 1;
		}

		return permutaion(hit, list, N, K) * p;
	}