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.

[[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[98, -11, 98, 26, 10]

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

[[-189, -108, -140, -62, 93, -40], [-181, -182, -94], [59, -99, -108, 70, 19], [-52, 45, 10, 75], [-6, -148, 79], [37, -28, -97, -186, 76, 23], [-96, 99, 24, -194], [-131, 40, 28, -164, -25, -53], [-46, -116, -189]]

[93, -94, 70, 75, 79, 76, 99, 40, -46]