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]

[[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]
[80, 88, 84, 99, 34]

[[-185, -107, -112, 42], [36, 28], [-196, 32], [92, -101, -57, 97], [37, -148, -18, 12, 3, -96], [-98, -184, 55, -63], [-96, -10], [-177, -6]]

[42, 36, 32, 97, 37, 55, -10, -6]