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: [[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]

Output: [11, 11, 35, 82, 48, 95, 2, 0, -115]


Input: Consider Input: [[-168, -52], [-183, 2, -104, 24, -153, -56], [25, 78, -118, -28, -39, -12], [97, 95, 12, -21, 82]]

Output: [-52, 24, 78, 97]


Input: Consider Input: [[-99, -133, -115, -2, 67, -131], [-175, 47, -11, 13, -46], [-23, 89, -37, -98, -149, 66, 89], [-113, -71, -156, -57], [14, -71, 13, 30, 74, -197, -2]]


Output: [67, 47, 89, -57, 74]