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: [[-38, 56, -23], [-19, -178, -59]]

Output: [56, -19]


Input: Consider Input: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]

Output: [68, 57, 94, 3, 88, 34]


Input: Consider Input: [[79, -17, -200], [-60, -107, -135], [-130, 72, -146, 13, 17, -67], [58, -107, 68, -61, 27, -75], [31, 60, -21], [-16, 98], [-58, -125, -174, -119, -189, 86]]


Output: [79, -60, 72, 68, 60, 98, 86]