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.
[[-91, -28, -61, -188, -6], [-140, 96, 76, -36, 30, -182, 71], [-180, -54, 73, -24, 57], [-177, -74], [73, -9, 87], [57, -22, 91, 58, -184, -52, 45], [-100, -180, 51, -186, -164, -14, -168], [92, -68, -130], [10, -160, -13, 41]]