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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

Output: [-3, 50, -38, 51, 42, 54, 81, 76]


Input: Consider Input: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]

Output: [-26, -126, 23, 95, 100, 13]


Input: Consider Input: [[-22, 13, -74], [-169, 45, -118, 69, 27], [-168, 16, -42], [97, -174, -141, -73, -41, -116]]


Output: [13, 69, 16, 97]