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]

[[-188, 39, -44, -107, -22, 98, -9], [84, 6, -2, -157]]
[98, 84]

[[-153, -16, -26, 26], [-16, -198, 93, -77, -135, -46, -26], [1, -130, -125, -166, 63, -59], [-157, -123, 100, -153, -111], [-101, -150, -84, -19, -56, -13, -13], [-130, 93, -174, -12, 4], [-162, 49, 14, 40]]

[26, 93, 63, 100, -13, 93, 49]