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: [[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]

Output: [46, 81, 96, 3, -2, 89, -67, 77]


Input: Consider Input: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

Output: [99, 48, 31, 77]


Input: Consider Input: [[40, -138, -136], [41, -110, -168, -10, -85, 40], [-29, 52], [-20, -163, 60], [-23, -17, -41, -88, -96], [-167, 24], [-113, -61, -81, -95, -117, 90], [57, -166, -105, -85, -176, 81]]


Output: [40, 41, 52, 60, -17, 24, 90, 81]