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.
[[-111, -6], [-98, -156, 29, -181], [-62, -150, -89, 9, -140], [-12, 42, -24, -192], [71, -172, 26, -114, 83, 66, -183], [11, 100, 94, -155, 72], [-98, -131, -98, 69, -177, -90, -182], [-156, -199, -137, -29, -2, -194, -151]]