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.

[[4, 27, 7, 92, -49], [-198, 59, -131, -73], [-130, -48, -135, 58], [57, -189, -99, 66, 51, 1], [90, 55, -174, -161, -148, -181]]
[92, 59, 58, 66, 90]

[[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]
[95, 98, 86]

[[-104, -12, -59, -188, 50, 10, 39], [-58, 14, -178, -18, 18], [-176, -90, -1, -119, -128], [-146, -137, -57, 35, -193, 13, 53], [67, -174], [-186, -182, -155, -185]]

[50, 18, -1, 53, 67, -155]