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.

Example Input: [[-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]]
Example Output: [-41, 13, 43, 88, 15, 32, 33, 57]

Example Input: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
Example Output: [95, 58, 72, 99, 80, 89, -18, -25]

Example Input: [[-40, 67, -6, 31, 93, 48], [19, 71, -199, -149], [-53, -103], [-16, -72, 47, -48, -82, 23, -88], [-156, -27, 53, 28, -60, 21]]
Example Output:
[93, 71, -53, 47, 53]