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.
[[-123, -142, 24, 22, -74], [-91, -186, -185, -9, -77], [-145, -91, -73, -134, -62, -45, 39], [-62, -10, -32, -156, -50], [34, 12, 1, -33, -83], [-19, 76, 68], [-152, -82, 13, 39, -183, -73], [7, 79, 51, -2, -139, -172, -82]]