input: Write a function to find the consecutive integers in a list that add up to a given integer k. Return the sublist of consecutive integers if found, otherwise return -1.
  
  assert find_consecutive_integers([1,3,5,7,9], 10)==[1,3,5,9]
  assert find_consecutive_integers([1,2,3,4,5], 15)==[1,2,3,4,5]
  assert find_consecutive_integers([2,4,6,8,10], 18)==[]
  assert find_consecutive_integers([1,1,1,1,1], 7)==-1
  assert find_consecutive_integers([], 5)==-1
output: def find_consecutive_integers(nums, k):
      n = len(nums)
      for i in range(n):
          current_sum = 0
          for j in range(i, n):
              current_sum += nums[j]
              if current_sum == k:
                  return nums[i:j+1]
              elif current_sum > k:
                  break
      return -1