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.

[[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
[91, -17, 64, 81, 54, 100]

[[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
[27, -10, 40, 78, 74, 22, 51]

[[-198, 99, 85, 6, -1, -171], [-188, -175, 59], [-58, -91, -167, 11, -81, -15], [-78, 40, -172, -150, -123], [-185, -90]]

[99, 59, 11, 40, -90]