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: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]

Output: [-2, 73, 94, 81]


Input: Consider Input: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]

Output: [-135, 19, -152, -91, 22, -152]


Input: Consider Input: [[49, 56, 7, 60], [57, 22, 27, 98], [-78, 66, -105, 5], [1, 24, 17, 90, -166], [-192, -192, -153, -2, -25, -113, 87], [-51, 19], [-14, 48, 29, -62, 30, 94], [-193, 98, -92, -2, 38], [-70, 59, -10, -120]]


Output: [60, 98, 66, 90, 87, 19, 94, 98, 59]