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.
[[-113, 83, -170, -39, -96, 41, -162], [74, -96, -29, -16], [-68, -25, -123], [-105, 30, 36, 46, -44], [-143, -182, 18, -87], [-144, 66, 46, -79, -198, -125, -182], [33, -91, -2, -198], [-16, -40, -167], [26, 72, -168, -157, -158, -118, 44]]