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.
[[-41, 40, 10], [-22, -133, -51, -167, -70, -124], [59, 11, 0, 27, -122, 60], [-71, -160, 87, -167, -84, -197, -197], [-17, -135, -98, -55], [-28, -74, -145, 57, -25, 61, -180]]