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: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]
Example Output: [99, 1, 16, 19, 62]

Example Input: [[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]
Example Output: [52, -25, 74, 91, 52, 98, -13, 95]

Example Input: [[-12, 10, -166, -178], [-38, 94, -83, -14, -101, -71, -137], [-119, -15, -47, -24], [-168, -169, 34, 27, -140, -92], [-33, 50, 78, -185], [-17, 31, 4, -144]]
Example Output:
[10, 94, -15, 34, 78, 31]