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: [[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]

Output: [-35, 73, 58, 72]


Input: Consider Input: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]

Output: [85, -8, 67, 45, 71, 91]


Input: Consider Input: [[-32, -135, -70], [90, 64, -73, -147, 15], [68, -192, -117, 73, -169, -17, -9]]


Output: [-32, 90, 73]