input: Write a function to find the consecutive integers in a list whose sum is equal to a given integer k. If such consecutive integers are found, return a list containing these integers. If there is no such subarray, return -1.
  
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,6]
  assert find_consecutive_integers([1,2,3,4,5], 12)==-1
  assert find_consecutive_integers([5,5,5,5], 20)==[5,5,5,5]
  assert find_consecutive_integers([1,4,20,3,10,5], 33)==[20,3,10]
  assert find_consecutive_integers([], 0)==-1
output: def find_consecutive_integers(arr, k):
      n = len(arr)
      for i in range(n):
          current_sum = 0
          for j in range(i, n):
              current_sum += arr[j]
              if current_sum == k:
                  return arr[i:j+1]
              elif current_sum > k:
                  break
      return -1