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.

[[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[-20, -50, 86, 95]

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

[[27, 59, 90, -99, -13, 68, -169], [-49, -99, -99], [-7, 78, -21, -166, -80, -96, -124], [58, 29, -90], [54, 86, 55, 75, 95, -129, 53], [-162, 86, -187, 45], [-120, 92, 25], [-38, -159, -175, 11, -106, -85, 87]]

[90, -49, 78, 58, 95, 86, 92, 87]