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: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

Output: [41, -44, 34, 86, 26]


Input: Consider Input: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

Output: [99, 1, 16, 19, 62]


Input: Consider Input: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]


Output: [78, -36, 49, 35]