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: [[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]
Example Output: [76, 90, 90, 47, 94, 92]

Example Input: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]
Example Output: [78, -56, -80, 89, -112, 49, -93, 91, -94]

Example Input: [[-46, -40, 14], [15, -131, 51, 59, -1, 93], [9, 58, -39, -25, -185, -108, -154], [-34, -107, -27, 5, 76, -115], [69, -2, 40, -6, 87, -134], [-90, -125], [-4, -130, 64], [71, 43, -150, -180]]
Example Output:
[14, 93, 58, 76, 87, -90, 64, 71]