input: Write a function to find the consecutive integers in a given list that sum up to a given integer k. If such consecutive integers are found, return them as a list; otherwise, return -1. If k is greater than the sum of all elements in the list or if k is negative, return -1. If the given list is empty, 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], 12)==[3,4,5]
  assert find_consecutive_integers([1,2,3], 7)==-1
  assert find_consecutive_integers([4,6,10], 5)==-1
  assert find_consecutive_integers([], 3)==-1
output: def find_consecutive_integers(lst, k):
      if not lst or 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