input: Write a function to find the consecutive integers in a given list of integers whose sum is equal to a given integer k. If no such sequence exists, return -1. If the input list or k is invalid, also return -1.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [1, 3, 5, 7]
  assert find_consecutive_integers([1, 3, 5, 7, 9], 12) == -1
  assert find_consecutive_integers([1, 2, 3, 4, 5], 9) == [2, 3, 4]
  assert find_consecutive_integers([], 5) == -1
  assert find_consecutive_integers([1, 2, 3], -1) == -1
output: def find_consecutive_integers(lst, k):
      if not lst or k <= 0:
          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