input: Write a function to determine if there exists a consecutive subarray in a given list of integers whose sum is equal to a given integer k. If there exists such a subarray, return the subarray. If no such subarray exists, return -1. If the given list is empty or if k is negative or greater than the sum of the list, return -1.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [3, 5, 7]
  assert find_consecutive_integers([1, 3, 5, 7, 9], 20) == -1
  assert find_consecutive_integers([1, 3, 5, 7, 9], 0) == -1
  assert find_consecutive_integers([], 10) == -1
  assert find_consecutive_integers([1, 3, 5, 7, 9], -1) == -1
output: def find_consecutive_integers(lst, k):
      if not lst or k < 0 or k > sum(lst):
          return -1
      n = len(lst)
      for i in range(n):
          current_sum = 0
          for j in range(i, n):
              current_sum += lst[j]
              if current_sum == k:
                  return lst[i:j+1]
              elif current_sum > k:
                  break
      return -1