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: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]

Output: [49, 79, 8, 70]


Input: Consider Input: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

Output: [86, 23, 78, 68, -116, 72, 55, 53]


Input: Consider Input: [[-200, -199, -21], [-76, -37], [-86, -69, -90], [33, 39, -123, -75, 5, -179], [-181, 34, -89, 58, -34, -154, 96], [-193, -33, -109], [-137, -11, -46, -149]]


Output: [-21, -37, -69, 39, 96, -33, -11]