In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-150, -28, 19, -109], [2, -189, -46, 84, 15, -87], [-57, 1, -59, -81, -197], [64, -110, 41, 82, 19, 99, -82], [29, -7, -56, 96, -148, -146, -150], [-70, -110, -108, -198], [-22, -10, 32], [1, -129, -112, 71, -195, -10], [19, -42, -112]]