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.

[[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]
[-41, 13, 43, 88, 15, 32, 33, 57]

[[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
[75, 5, 96, 58, 93, -49, -5, 82, 92]

[[48, 94, -169, -69], [-142, -86, 65, 89, -120, 49], [-109, -29, 26, -79, -173, -176, 1], [21, -72, 80, -127], [8, -138, -10, -11, -110, 27]]

[94, 89, 26, 80, 27]