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: [[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

Output: [-163, 37, 98, 77, 58, 47]


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: [[-56, 18, -171, 68, -118, -118], [71, 83, 83, -99, -163, -197, 47], [-150, -30, 95, 95, -124, -180, -135], [-38, -181, 75, 39, 82, -79, 41], [78, 11], [2, 20, 78, 46, 0, -49, -159], [79, -89, -132, 56, -18, 82, -157], [-18, -34, 59, -112, 84], [72, -25, 95]]


Output: [68, 83, 95, 82, 78, 78, 82, 84, 95]