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]

[[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]
[79, 65, -87, 89, -2, -13, 20, -184]

[[-43, -166, 85, -168, -47, 48, -108], [-74, 42], [-179, 36, -143, -156, -171, -35, -128], [-82, -85, -17, -128, -29, -77], [44, 76, -129, -84], [-195, -27, -82, -148]]

[85, 42, 36, -17, 76, -27]