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.

[[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]
[59, 98, 87, 79]

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

[[-32, 22], [55, -147, 36, 40], [84, -35, -3, 89], [9, 55, -200, -63, -189], [-95, 27, -197, -15, -61], [28, 97, -187, -116, 17], [-78, -22, -29, -30, -87, -41, 3]]

[22, 55, 89, 55, 27, 97, 3]