input: Write a function to find consecutive integers in a list whose sum is equal to a given integer k. The function should return the list of these consecutive integers if found, otherwise return -1. If the given integer k is greater than the sum of all elements in the list or k is negative, return -1 directly.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [3, 5, 7]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 15) == [1, 2, 3, 4, 5]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 9) == [2, 3, 4]
  assert find_consecutive_integers([1, 2, 3], -1) == -1
  assert find_consecutive_integers([], 5) == -1
output: def find_consecutive_integers(lst, k):
      if k < 0 or sum(lst) < k:
          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