input: Write a function to find consecutive integers in a list whose sum is equal to a given integer k. If the sum of k is greater than the sum of the list or less than zero, return -1. If a window of consecutive integers summing to k is found, return that window. If no such window is found, return -1.
  assert find_consecutive_integers([1,3,5,7,9], 10) == [1, 3, 5, 7, 9]
  assert find_consecutive_integers([1,3,5,7,9], 12) == [5, 7]
  assert find_consecutive_integers([1,3,5,7,9], 15) == -1
  assert find_consecutive_integers([], 10) == -1
  assert find_consecutive_integers([1,3,5,7,9], 0) == -1
output: def find_consecutive_integers(lst, k):
      if k > sum(lst) or k < 0:
          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