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: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]

Output: [57, 65, -18, 45, 82, 96, 44, 23]


Input: Consider Input: [[14, -199], [-96, -75, -1, -54, -147, 98, 70], [2, 49, -99, -98, 48], [45, -143, -123, 36, 77, -115, -27], [-102, -120, -166], [69, -52, -1, -104], [-72, -135], [-77, 69, -114], [-47, -151, -82, -73, 92, -19]]

Output: [14, 98, 49, 77, -102, 69, -72, 69, 92]


Input: Consider Input: [[57, 22, 42, -130, -153, -36, -113], [-186, -104, -119, 32], [93, 0, -20, -180, -168, -37, -181], [6, 36, -26], [-171, -57, -49, -7], [-111, -76, -121, -73, 88, -166], [-118, 69, -73, 40], [-14, -116, -151, -80, -83, -59]]


Output: [57, 32, 93, 36, -7, 88, 69, -14]