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]

[[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]
[-68, 30, 99, 15]

[[11, -187, -200, 0, 77, -130], [94, -39, -8, -110, -92, -140], [-44, 99, 82], [-28, -71, -108, -175, -2, 20]]

[77, 94, 99, 20]