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.

Input: Consider Input: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]

Output: [89, -13, 20, 92, 100, 13, 6, 88, 71]


Input: Consider Input: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

Output: [34, -30, 37, 55, 85, 61]


Input: Consider Input: [[59, -67, -98, -45, -64, -179], [-97, -191, 99, 66, -153], [-55, 48, -61, -122], [-76, -86, -128], [4, -176, -165, -186, 14], [-29, -101, -163, 97, 41, -18, -143], [-46, 14, -144], [21, -102], [-198, 2, -140]]


Output: [59, 99, 48, -76, 14, 97, 14, 21, 2]