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.

[[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[61, 28, 95, 9]

[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[96, 48, 65, 19, -26, 95, -11]

[[-196, -137, -48], [-114, -112, 84, -123, -105, 80], [-104, -50, -171, -2, 70, 49, 17], [89, 100, -41, 95, 97, 39]]

[-48, 84, 70, 100]