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.

[[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]
[65, 75, 21, 82, 4, -3, 21]

[[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]
[97, 24, -43, 79, 51, 72]

[[-29, -89, -58, -110, 28, 72], [94, -160, 8, 29, -176], [-102, -193, -40], [46, -162]]

[72, 94, -40, 46]