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.

Example Input: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
Example Output: [86, 46, -128, 81, 40, 67]

Example Input: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]
Example Output: [47, 27, 93, 67, 100, 70, 11, -5, -17]

Example Input: [[-193, -47], [-137, -11, -136, -152, -96, 56, -90], [-127, -75, 98, -73, 73], [-4, 44], [53, 62, -49, -135]]
Example Output:
[-47, 56, 98, 44, 62]