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.

[[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[55, 64, 56, -31, -4, 51]

[[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[78, 86, -72, -153]

[[-151, -110, -159, -29, -57, -48, -50], [-57, 23, -37], [81, -117, 23, 1, 94], [-65, -79, 58, 35, -146], [23, -132, 31, 1, -174, -22, -181], [96, -27, 70, -9], [-27, -76, 66, 38, -34, -65, -22], [92, -164, -77, -39, -187], [-46, 48]]

[-29, 23, 94, 58, 31, 96, 66, 92, 48]