input: Write a function to find the consecutive integers in the given list that sum up to the given integer k. If the sum is greater than the given integer or less than 0, return -1. Otherwise, return the list of consecutive integers that sum to k. If no such subarray exists, return -1.
  assert find_consecutive_integers([1,3,5,7,9], 10)==[3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 12)==[3,5,7]
  assert find_consecutive_integers([1,4,3,2], 6)==[3,2]
  assert find_consecutive_integers([1,4,0,3], 4)==[4]
  assert find_consecutive_integers([1,4,0], 3)==[4]
output: def find_consecutive_integers(nums, k):
      n = len(nums)
      for i in range(n):
          current_sum = 0
          for j in range(i, n):
              current_sum += nums[j]
              if current_sum == k:
                  return nums[i:j+1]
              elif current_sum > k or current_sum < 0:
                  break
      return -1