input: Write a function to find the consecutive integers in a list whose sum is equal to a given integer k. If no such consecutive integers exist, return -1. 
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10)==[1, 3, 5, 7]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 5)==[2, 3]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 15)==[1, 2, 3, 4, 5]
  assert find_consecutive_integers([10, 20, 30, 40], 50)==[20, 30]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 100)==-1
output: def find_consecutive_integers(lst, k):
      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