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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]
Example Output: [85, 82, 95, -111, 24, -112, 65, 65, 16]

Example Input: [[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]
Example Output: [57, -17, 58, 53, 51, 88, 25, 61, 73]

Example Input: [[-54, 23, -114, -84, -72, -104], [-35, -159, 72], [-70, -7, 72, -92, -155, 57, 53], [-63, -160], [-71, -182, -157, -173], [-165, 54, -137, -166, 58], [-91, -199, -82, 22, -66]]
Example Output:
[23, 72, 72, -63, -71, 58, 22]