input: Write a function to find the consecutive integers in a given list that sum to a given integer k. Return the list of consecutive integers if found, else return -1. If the sum of k is greater than the sum of the entire list or k is negative, return -1 directly.
  
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,5,7]
  assert find_consecutive_integers([1,2,3,4,5], 9)==[2,3,4]
  assert find_consecutive_integers([1,2,3,4,5], 11)==-1
  assert find_consecutive_integers([0, -1, 1], 0)==[0]
  assert find_consecutive_integers([], 5)==-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