def reverse_Array_Upto_K(input, k):
   
  return (input[k-1::-1] + input[k:]) 
def is_not_prime(n):
    import math
    
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result