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: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]

Output: [86, 76, -100, 99, 27, -48]


Input: Consider Input: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

Output: [47, 40]


Input: Consider Input: [[71, -73, -98, -88, -18, 4], [-99, -197, 46, 73], [85, -143, -85], [23, -187, -33, -98, -37], [-151, 71, -21], [-97, -22, -51, -112], [-2, 11, -175, -102, -196, -31, -92]]


Output: [71, 73, 85, 23, 71, -22, 11]