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.

[[-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]

[[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[-111, 83, -8, 92, 55, 91, 70]

[[98, -189, -65, -125, 48, -83, -9], [-134, -9], [84, 86, -99, -82, -155, -140, -121], [-184, -185, 85, -102, -197, -163, -21], [-69, -136, -143, 57, 100, -166]]

[98, -9, 86, 85, 100]