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.
[[-83, -155, -128, -129, 27, -84, -135], [-66, -87, -104, 75, -34, 74], [-24, -184, -122], [-176, -16, -15, 53, -116, -200], [-151, -115, -38, 43, 72, 49], [36, -109], [-140, -29, -179], [48, -139, -142]]