input: Write a function to find and return the consecutive integers in a list whose sum is equal to a given integer k. If no such consecutive integers exist, return -1. If the given list is empty or the given integer k is greater than the sum of all elements in the list or less than 0, return -1.
  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], 3) == [1,2]
  assert find_consecutive_integers([1,2,3,4,5], -1) == -1
  assert find_consecutive_integers([], 5) == -1
output: def find_consecutive_integers(lst, k):
      if not lst or 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