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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

Output: [85, 82, 95, -111, 24, -112, 65, 65, 16]


Input: Consider Input: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]

Output: [55, 92, 45, 57, 41, 86, 35, 85, 85]


Input: Consider Input: [[66, 21, 70, 0, -142, -155, -195], [-133, -154, -6, -128, -75], [-167, -53, -177], [-8, -68, 36], [-34, -64, -127, -48, -123], [-67, 30, 62, 100, 50, -49]]


Output: [70, -6, -53, 36, -34, 100]