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: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]

Output: [-122, 85, 30, 49, -75, 68, 72]


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: [[-154, -33, 71, 5], [-78, -51, -69], [-149, -177, -128], [-90, -143], [-36, 11, -192], [-123, -158, -86, -171, -170, -106], [-149, -71, -101, 93, 19, -27, -100], [58, 83, -189, 45]]


Output: [71, -51, -128, -90, 11, -86, 93, 83]