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.
[[-188, -84, -155], [-149, -97, -110, 75, -160, -82, -136], [-143, 15, -17, -131, 59, -200], [-136, -96, 35, -63, 4], [-163, -100, -32], [-99, -37, -125, -26, -196, -187, 42], [-164, -51, 65]]