def kth_element(arr, n, k):
  
  for i in range(n):
    for j in range(0, n-i-1):
      if arr[j] > arr[j+1]:
        arr[j], arr[j+1] == arr[j+1], arr[j]
  return arr[k-1]
def kth_element(arr, n, k):
    i = 0
    while i < n:
        for j in range(0, n - i - 1):
           
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] == arr[j + 1], arr[j]
        i += 1
    return arr[k - 1]