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.
[[54, -6, -73, -107, -148, -39], [9, -90], [-167, 36, 8, -1], [-6, 33, -37], [-153, -130, 9], [-113, -74, -13, 67, -61], [94, 96, -200, 36, -19], [-175, -109, -76, -108], [-188, -121, 63, 92, 67]]