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.

[[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
[100, -120, -94, 63, 50, -139, 80, 56, 88]

[[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]
[96, 94]

[[46, -122, -112, -120, -14], [-174, -56], [-162, -162, -138, -126, -96], [93, 54, -24], [-167, 48, -79, 96, -3, -109, -100], [-21, -19, 25, -54, -102, 95], [-120, -199, -194, -106, 28]]

[46, -56, -96, 93, 96, 95, 28]