input: Write a function to find the consecutive integers in a given list whose sum is equal to the given integer k. If no such sequence exists, return -1. If k is greater than the sum of the list or if k is negative, return -1.
  assert find_consecutive_integers([1,3,5,7,9], 10)==[3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 100)==-1
  assert find_consecutive_integers([], 10)==-1
  assert find_consecutive_integers([1,2,3], 6)==[1,2,3]
  assert find_consecutive_integers([1,2,3], 7)==-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