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.
[[-46, -112, -5], [30, -105, -192, 50, 90, 24, 41], [26, -196, 82, 78], [42, -148, -198, 12, 39], [-78, -113, 27, -32, -109, -73, -165], [1, -176, -158], [8, -42, -182, 33, -135]]