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: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]
Example Output: [82, -35, 37, 86, 1, 46, 99]

Example Input: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]
Example Output: [67, 26, 7, -16, 78, 79, 4, 85, 35]

Example Input: [[-72, -16, -36, -198, -93], [-182, -95, 10, 28], [-163, 86], [-180, -43, -59, 14, 61, 62, -145], [62, -35, -71, -165], [-150, -33, -45, -159], [-190, -17, -178, 62, -108, -141], [43, -92, -7, -95], [92, -103, -67, 0, -164, 40, 100]]
Example Output:
[-16, 28, 86, 62, 62, -33, 62, 43, 100]