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.

[[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]
[-26, 74, 56, 71]

[[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]
[33, 100, 74, 69]

[[-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]]

[-6, 29, 9, 42, 83, 100, 69, -2]