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: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
Example Output: [91, -17, 64, 81, 54, 100]

Example Input: [[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]
Example Output: [72, 77, 74, 24, -168, -8, 64, 59, 45]

Example Input: [[99, -42, 80], [77, 48, -100, -136, -69], [25, -124, -20, 90, -90, -119], [25, 91], [-79, 49, -48]]
Example Output:
[99, 77, 90, 91, 49]