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.
[[-40, -195, 50], [10, -47, -3, -144, -62, -113, -15], [21, -152, -33, -135, -56], [-51, -70, 80, -118, -13, 7, 58], [-155, -140, -1], [-135, -147, -33, 77, -120], [78, -157, -6, -29, -180], [-172, 7, 53, 25, 55, -155, -166]]