input: Write a function to find the consecutive integers in a given list whose sum equals a given integer k. The function should return the list of consecutive integers if found, otherwise return -1. If k is greater than the sum of the list or less than 0, return -1 immediately.
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,5,7]
  assert find_consecutive_integers([4,7,2,8], 15)==[7,2,8]
  assert find_consecutive_integers([2,5,1,3], 7)==[5,1,3]
  assert find_consecutive_integers([1,2,3,4], 11)==-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