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.
[[-192, 42, -72, 85], [61, -82, -81, -169], [-80, -199, -184, -97, 75, 92], [66, -141, 55], [81, -115, -142, 9, -12], [-179, -119, -92, 19], [-6, 52, 11, -16, 67, -172], [-96, -25, -179, -40], [-23, -123, 58, -195, -194, -66, -165]]