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: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]

Output: [-47, 0, -11, 6, 85, 50]


Input: Consider Input: [[-107, 41, 2, -56, -164, -190], [-61, -10]]

Output: [41, -10]


Input: Consider Input: [[-50, 51, -120, -115, -82], [41, -38, -133, 93, 97, -106], [44, 69, 74, -115], [-185, -126, -40, 87, 19], [-137, -4, 26, -192, 33, -43, -28], [-74, -187, -57, -20, -172], [61, -8, 75, -194, -77, 96, -30]]


Output: [51, 97, 74, 87, 33, -20, 96]