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, -88, -179, 51], [38, -77, 5], [-4, -185, 32, -191, -82], [-191, -170, -36, 43, 60], [-117, -81, -197, -90, 26, 6, -112], [-9, 8, -79], [28, -200, -50, 82, -125, 99, -30]]