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, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Output: [38, 80, 94, 31]


Input: Consider Input: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]

Output: [71, -3, 48, 90, 92]


Input: Consider Input: [[25, 99, -110, 86, -78], [-126, 23, 86, -11, 2, -164], [-110, -127, 4, -71, -124, 40, -42], [-157, 91], [37, 5], [31, -145, -140, -164, 99], [87, -34, -100, 8, 48], [89, -123, -143, 51]]


Output: [99, 86, 40, 91, 37, 99, 87, 89]