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: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
Example Output: [41, -44, 34, 86, 26]

Example Input: [[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]
Example Output: [70, 56, -22]

Example Input: [[-48, -133, 49, -52], [-43, -191, -98, 47, -110, -32], [-3, 81, 75], [-86, 20, 90], [-182, 32, -113, -183, -4, 54, 1], [-188, -84], [-163, -47, -62, -81, 82, -173, -164], [-2, -1, -90, 95, 41, -198, -8]]
Example Output:
[49, 47, 81, 90, 54, -84, 82, 95]