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.
[[-125, -41, -191, -197, 4, -127], [68, 35, 76, -4, -160, -81, -40], [-95, -169, -191], [-160, -60, -27, -81, -76, -8, -198], [-79, 54, -48, 33], [79, -94, -189, 42, -57], [94, -43, 42, -140, 98], [65, 60, -192, -192, -120, -170], [64, -184, 71, -83, -162]]