input: Write a function to find whether within a provided list of integers, there exists any subsequence of consecutive integers whose sum equals a given integer k. If such subsequence exists, return the subsequence; otherwise, return -1. If the given integer k is greater than the sum of the list or less than 0, return -1.
  
  assert find_consecutive_integers([1,3,5,7,9], 10) == [3,5,7]
  assert find_consecutive_integers([1,3,5,7,9], 23) == -1
  assert find_consecutive_integers([1,2,3,4,5], 7) == [3,4]
  assert find_consecutive_integers([10], 10) == [10]
  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