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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

Output: [82, -53, 34, 100, 65, 57, 65, 58, -101]


Input: Consider Input: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

Output: [52, 76, 70, 93, 26, 99, 12, 94]


Input: Consider Input: [[-98, 38, -173, -75, -164, -200], [-103, -167, 20, -58, -116, -154, -170], [-6, -123, -199, -133, -33, -48, -194], [48, -9], [-28, -7, -26, -46, -83], [-80, 4, -59, -23]]


Output: [38, 20, -6, 48, -7, 4]