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.
[[-1, 68, -163, -165, -146, 70], [39, -157, -95, -117, -192, -183, 38], [-182, -52, 42, 2, 13, 87, -105], [83, 34, -74, 86, 3, -21], [-169, 74, -27, -193, -154], [-49, -120, -15], [-170, -92, 21, -120, 23, -131, 80], [45, -40, -25, -200]]