Should Space Compexity be O(n^2) + O(n) = O(n^2) instead of O(n^3)?

If you look at the last line carefully, it says that the total size of output lists is o(n^2) and each subarray can take o(n) space so, the space complexity should be o(n^2) * O(n) which ould be o(n^3)