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: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
Example Output: [37, 32, 34, -3, 97, 97, 68]

Example Input: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]
Example Output: [38, 98, 39, 24, -38, 1]

Example Input: [[24, -90, 32, -47, -37], [-58, -4, -106, 28], [-138, -66, 64, 64, 76, -175, -16], [41, -6, 46, -91], [99, -76, -123, -24, 89, -129], [64, 61], [-119, 96, -116, -88, 2, -109, -70], [85, -53, -162, -198, 83]]
Example Output:
[32, 28, 76, 46, 99, 64, 96, 85]