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: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
Example Output: [21, -38, 99, 89, 40, 46, 69]

Example Input: [[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]
Example Output: [54, 30, 52, -59, 74, 43, -151, 64]

Example Input: [[63, -23, -162, 20, -168, -92, -191], [94, 50, 57, 23, 100, 76, -115], [-77, 43, -1, -23, -160], [-151, -99, -178, -94, 0, 2], [25, 36, -194, -140, -7]]
Example Output:
[63, 100, 43, 2, 36]