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: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]
Example Output: [97, 23]

Example Input: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
Example Output: [76, -40, 87, 30, 27, 27, 51]

Example Input: [[53, -8, 37], [31, -162, -194, -175, 2], [-192, -27], [-49, -59, -92, -126, -122], [-64, 81, -154, 65], [-97, -163, -136, -155], [-153, -69, -181, 58, -32], [-121, -105, -127, -61, 93, 2, 84], [86, -166, -151, -153, 5, 29]]
Example Output:
[53, 31, -27, -49, 81, -97, 58, 93, 86]