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: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
Example Output: [81, -36, 35, 65, 59, -31, 33, 89, 98]

Example Input: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]
Example Output: [40, 84, 55]

Example Input: [[-163, -192, -175, -80, -200], [3, 22, 90, 59, 13, -5, -95], [-65, -75], [-91, -117], [17, -144, -69, -112, 72], [-54, -82, 98], [-89, -50, -69, -67, -112, 64]]
Example Output:
[-80, 90, -65, -91, 72, 98, 64]