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: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]

Output: [39, 6, 91, -7, 52, 99]


Input: Consider Input: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

Output: [65, 75, 69, 44, 52, 16]


Input: Consider Input: [[-90, 74], [-162, 16, -148, 72, -14], [-198, 87], [-156, -55], [-176, -19, -146]]


Output: [74, 72, 87, -55, -19]