input: Write a function to find consecutive integers in a list whose sum is equal to a given integer k. If it is possible to find such integers, return the list of those integers. If not, return -1.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [1, 3, 5, 7]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 9) == [2, 3, 4]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 20) == -1
  assert find_consecutive_integers([1, 3, 5, 7, 9], 15) == [1, 3, 5, 7]
  assert find_consecutive_integers([], 0) == -1
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:
                  break
      return -1