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: [[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]
Example Output: [85, 21, 34, 90, 81, 32, 77, 65, 97]

Example Input: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
Example Output: [97, -5, 47, -13, 95]

Example Input: [[-122, -116, -158, -14, 100, -78, -69], [-72, -172, 16], [-105, -113, -145, 37, -25, -11], [-174, 32, -35, 26, -58]]
Example Output:
[100, 16, 37, 32]