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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
Example Output: [95, 57, -144, 66, 54, 52, 93, 100, 21]

Example Input: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]
Example Output: [97, 45, 26, -42, 45, 44, 27, -42]

Example Input: [[-49, 31, 78, 13], [-110, -88, 61, -27, -155, -103, -32], [-6, -109, -72, 56], [-65, -181], [-61, 37, 1, 21, 25], [81, 7, -44, 7, -144], [-53, -161, -44], [-35, 26, -46, -185, -164]]
Example Output:
[78, 61, 56, -65, 37, 81, -44, 26]