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.

Input: Consider Input: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Output: [45, 33, 26, 69, 89, 95, 57, -4]


Input: Consider 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]]

Output: [90, 98, 22, 85, 64, 77, 63, -152]


Input: Consider Input: [[44, -198, -68, -70, -185, -136], [-177, -65, -192, -177, 87], [-181, 33, 2, -87, 17, 3], [-7, -113, -49, -169], [16, -190, -115], [85, -14, -44, -41, -170, -142, -19], [-42, 14, -118, -116, 41], [-166, -111, -38, -68]]


Output: [44, 87, 33, -7, 16, 85, 41, -38]