input: Write a function to find consecutive integers in a list whose sum is equal to the given integer k. If no such sub-list exists, return -1. If k is greater than the sum of the list or less than 0, 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], 15) == -1
  assert find_consecutive_integers([4, 6, 3, 1, 2], 5) == [4, 6]
  assert find_consecutive_integers([2, 4, 2, 7], 9) == -1
  assert find_consecutive_integers([], 0) == -1
output: def find_consecutive_integers(lst, k):
      if k < 0 or sum(lst) < k:
          return -1
      for i in range(len(lst)):
          current_sum = 0
          for j in range(i, len(lst)):
              current_sum += lst[j]
              if current_sum == k:
                  return lst[i:j+1]
              elif current_sum > k:
                  break
      return -1