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: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]
Example Output: [60, -36, 94, 68, 36, -64, 41]

Example Input: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
Example Output: [0, -131, 75, 100, 90, 95, -24, 13, 10]

Example Input: [[39, -163, -28], [-28, -157, -19, -8, -178, 20], [7, -168, 81], [-173, -121, -119], [-65, -170, -39, 44, -124], [-109, 13, 12, -181, -161, -16]]
Example Output:
[39, 20, 81, -119, 44, 13]