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: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
Example Output: [90, 65, 16, 93, 30]

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: [[-86, -27, 55, -199, 70, -50, -34], [0, -185, -112, 38, 75, 63], [-117, -76, -27, 71, 39, -50], [9, -11, -176, -153, 47, -105], [36, 99, 22, 92, -67, -173], [49, 22, -110, -45, 20, -115], [-69, -142, -150, 18], [-13, -113, 14]]
Example Output:
[70, 75, 71, 47, 99, 49, 18, 14]