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: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]
Example Output: [78, 53, 93, 86, -31]

Example Input: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
Example Output: [71, 44, 78, 87, 68, 91]

Example Input: [[-46, 49, 68, -10, 84, -42, -195], [-154, -192, -138, 39, -178], [2, -42, -31, -94, 98, -126, -35], [-65, 78, 79, -1, 76, -21, 75], [7, -180, -119, -62], [-119, -68, -157, -54], [-114, 56, -115, -124, -110, 98], [-87, -44, -109, 52]]
Example Output:
[84, 39, 98, 79, 7, -54, 98, 52]