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: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

Output: [-92, 90, 8, 74, -126, 6, 7, -86]


Input: Consider Input: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

Output: [2, 72, 60]


Input: Consider Input: [[0, -191, -145, 22, 49, -191, 67], [64, 39, 58, 36], [-164, -169, 68, -148, -125], [-108, -63, 97, -61, 88, 75, 93], [-126, -165], [-183, 3, -155]]


Output: [67, 64, 68, 97, -126, 3]