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: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]

Output: [79, 95, 82, 66, -11]


Input: Consider Input: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

Output: [79, 65, -87, 89, -2, -13, 20, -184]


Input: Consider Input: [[-49, -178], [57, -95, 59, -60, -89, -21], [-75, -43, -97, 60, -66, -65]]


Output: [-49, 59, 60]