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.
[[-178, -97, -99], [-70, -127, 26, 24, 57], [51, -157, 59, -4], [-119, 38, 11, -74, 61, 86], [9, -9, 41, -169, -198], [-108, 20, -25, -111, 88], [-41, -196], [1, 95, 11, -118, -128, -119], [-26, 47]]