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: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]
Example Output: [81, -90, 8, 69, 91, 83]

Example Input: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
Example Output: [98, 30, 96, 87, 96, 67, 53]

Example Input: [[-131, -123, -161, -182, -198], [58, 49, -113], [-152, -88], [-177, -64, -19, 15], [-152, 88, 68], [-153, -197, -181, 82, -4], [-15, 17, 25, -88, 29, 73, -102], [-145, 69]]
Example Output:
[-123, 58, -88, 15, 88, 82, 73, 69]