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.

[[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[60, -32, 68, 93, 24, 26, 7, 85]

[[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]
[93, 17, 78, 84, 35]

[[78, 4, -107, -29], [-179, 86, -55], [67, -19, -31, -139, -153], [12, -41, -144, 56], [-79, 16, -138, -147, 48, -185], [19, -145, -20], [30, -90, -66, -57, 70, -42], [74, -15]]

[78, 86, 67, 56, 48, 19, 70, 74]