input: Write a function to find the consecutive integers in a given list whose sum is equal to a specified integer k. If no such subarray exists, return -1. If the specified sum k is greater than the sum of the list or less than 0, return -1.
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 7)==[3,5]
  assert find_consecutive_integers([1,3,5,7,9], 3)==[5]
  assert find_consecutive_integers([1,3,5,7,9], 20)==-1
  assert find_consecutive_integers([1,3,5,7,9], -5)==-1
output: def find_consecutive_integers(arr, k):
      total_sum = sum(arr)
      if k > total_sum or k < 0:
          return -1
      
      current_sum = 0
      start = 0
      for end in range(len(arr)):
          current_sum += arr[end]
          
          while current_sum > k:
              current_sum -= arr[start]
              start += 1
          
          if current_sum == k:
              return arr[start:end+1]
      
      return -1