human
Find the K | Function to find the index of number at first position of kth sequence of set of size n.
n_actual_fact = n !.
First position of the kth sequence will be occupied by the number present at index = k / ( n - 1 ) !.
Function to find the kth permutation of n numbers.
Store final answer.
Insert all natural number upto n in set.
Subtract 1 to get 0 based indexing.
Mark the first position.
itr now points to the number at index in set s.
remove current number from the set.
Driver code"
Solution in Python:

What is a code to find the K and the other steps required?
assistant
#Here is code to find the K and the other steps required.
 def findFirstNumIndex ( k , n ) :
	if ( n == 1 ) :
		return 0 , k
	n -= 1
	first_num_index = 0
	n_partial_fact = n
	while ( k >= n_partial_fact and n > 1 ) :
		n_partial_fact = n_partial_fact * ( n - 1 )
		n -= 1
	first_num_index = k // n_partial_fact
	k = k % n_partial_fact
	return first_num_index , k
def findKthPermutation ( n , k ) :
	ans = " "
	s = set ( )
	for i in range ( 1 , n + 1 ) :
		s . add ( i )
	k = k - 1
	for i in range ( n ) :
		itr = list ( s )
		index , k = findFirstNumIndex ( k , n - i )
		ans += str ( itr [ index ] )
		itr . pop ( index )
		s = set ( itr )
	return ans
if __name__ == ' _ _ main _ _ ' :
	n = 3
	k = 4
	kth_perm_seq = findKthPermutation ( n , k )
	print ( kth_perm_seq )