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: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]
Example Output: [90, 98, 22, 85, 64, 77, 63, -152]

Example Input: [[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]
Example Output: [-43, 100, 61, 82, -28, 42]

Example Input: [[-129, -91, -190, -138, -155], [82, -191, -76, 32], [66, -85, -66, -113, -49], [-128, -91, -46], [54, 11, -167, 74, 28, -127], [-195, -25, 74, -189, 9], [-24, -180, 92, -3, -181], [-96, -17, -144, 12, 50, -145], [16, -106, -196]]
Example Output:
[-91, 82, 66, -46, 74, 74, 92, 50, 16]