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: [[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]

Output: [98, 57, 95, 99, 87, 76]


Input: Consider Input: [[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]

Output: [9, 12, -158, -39, -80, 73, 51, 69, 53]


Input: Consider Input: [[-183, -149, -23, -77], [-91, -157, 4], [60, -108, -74], [47, -52, 26, -2, 30], [-198, 60, -22, -155], [-19, 3], [99, -156, -142, -91, -135, -182, -32]]


Output: [-23, 4, 60, 47, 60, 3, 99]