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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Output: [38, 80, 94, 31]


Input: Consider Input: [[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]

Output: [72, 77, 74, 24, -168, -8, 64, 59, 45]


Input: Consider Input: [[-51, 23, -167], [-42, 46, -53], [25, -13, 42, -148, -197, 26], [-112, -126, 8, -102, -12, 75, 80], [-41, 78, -126], [86, 92, -87, 94, -73]]


Output: [23, 46, 42, 80, 78, 94]