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.
[[-160, -172, -24, 6], [-198, -154, 8, -75], [-157, -79, 87, -123, -199, -128, -134], [-171, 10, -15, -65, 22, 23], [-172, 10, 100, 37], [-179, -62, -55, 12, 55], [-26, -182, -125, -196, -58, 20, 93], [31, -70, 23, -149, -65, -179]]