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.
[[57, -166, -70, 19, -128, -183, -102], [17, -85, -160, -135, -135, -87], [-188, -170, 88, -149, -76, -55, 74], [41, -39, 21, -139, -141, 65, 95], [-97, -179, 25, 27, -138, -195], [-91, -200, -102, -138, -139, -169, 10], [-103, -71, -38, 89, -46, -65], [52, -14, -97], [-127, 95, 87]]