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: [[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]

Output: [100, -81, 84]


Input: Consider Input: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Output: [45, 33, 26, 69, 89, 95, 57, -4]


Input: Consider Input: [[-152, 1, -173, -63], [-101, 2, -165, 65, -8, -25, 8], [-97, 34, 10, 12, -153, -138], [-35, -62, -55, 58, -60], [3, 80], [-144, -132, -110, -192, -50, -35], [-146, 27, -65]]


Output: [1, 65, 34, 58, 80, -35, 27]