input: Write a python function to find a sublist of consecutive integers that sum up to a given value k.
  assert find_consecutive_integers([1, 3, 5, 7, 9], 10) == [3, 5, 2]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 9) == [2, 3, 4]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 15) == [1, 2, 3, 4, 5]
  assert find_consecutive_integers([1, 2, 3, 4, 5], 20) == -1
output: def find_consecutive_integers(arr, k):
      n = len(arr)
      for i in range(n):
          current_sum = 0
          sublist = []
          for j in range(i, n):
              current_sum += arr[j]
              sublist.append(arr[j])
              if current_sum == k:
                  return sublist
              elif current_sum > k:
                  break
      return -1