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: [[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]

Output: [97, -37, 83]


Input: Consider Input: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

Output: [36, 86, 10, 81, 69, 41, 91, 34]


Input: Consider Input: [[-190, -52, 53, -170, -22, -81], [-80, -136], [-48, -102, -112, -164, -60], [67, -41, -140, -55, -143], [-141, -159, 98, 76, -41], [40, -65, -84]]


Output: [53, -80, -48, 67, 98, 40]