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.
[[-2, -195, -110, -140, -173, 57], [-147, 39, -116, 89, -38, 63], [-41, -182, -159, -63, -87, 56], [60, -22, 9, -140, 17], [-21, -1, -43], [-135, -3, -70, -148, -48, 73], [-175, -125, -178, -35, -38, 38, -51]]