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: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]
Example Output: [51, 49, 86, 66, 74, -151, 49, 25]

Example Input: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
Example Output: [91, 100, 86, 84, 13, 53, -32, 54]

Example Input: [[-154, 7, -118, -141], [67, -90, -143, -170, 2], [-69, -93, 53, 36], [-93, 63, -106], [-72, -59, -11, -39], [-134, 85, -24, -97, -162], [-167, -2, 3], [-150, 26, -196, -53, -93, 51, 53]]
Example Output:
[7, 67, 53, 63, -11, 85, 3, 53]