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: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

Output: [99, 54, 32]


Input: Consider Input: [[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]

Output: [92, -28, 98, 72, 23]


Input: Consider Input: [[-7, 37, -190, -103, 67], [60, -152], [20, -186, -85, -19, -157, 35, -177], [11, -47, -158, -197], [-109, -184, -124, -115, -97, -20]]


Output: [67, 60, 35, 11, -20]