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.
[[35, -149, -167, -162, -30, 75, -54], [-73, 15, 24, -186, -54, 15, -121], [-80, -165, -119, 17, 53, 44, 72], [-37, -37], [-174, 30, -127, 61, -175, -181, 66], [-16, -14, -63], [11, -20, 56, -161]]