input: Write a function to find the consecutive integers in a list that sum up to a given integer k. If no such consecutive integers exist, return -1. If k is greater than the sum of the list or k is less than 0, return -1 directly. The function should return the sublist of consecutive integers whose sum is equal to k.
  
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,6]
  assert find_consecutive_integers([1,2,3,4,5], 9)==[2,3,4]
  assert find_consecutive_integers([1,2,3,4,5], 15)==[1,2,3,4,5]
  assert find_consecutive_integers([1,2,3,4,5], 16)==-1
  assert find_consecutive_integers([], 5)==-1
output: def find_consecutive_integers(lst, k):
      if 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