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.
[[-185, -46, -51, -26], [-65, -35, -32, -143, -42], [-188, -72], [30, -8, -141], [28, -65, -1], [-165, 92, 6, -118], [-25, 75]]