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: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]

Output: [42, -49, 94, 89, -73, 5, -41, 89]


Input: Consider Input: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

Output: [53, 64, -34, 92, 22, 82, 85, 81, 43]


Input: Consider Input: [[-126, -32], [90, -91, -150], [-199, -114, 37, -183, -123], [50, -143, 45], [-97, -150, 40, -56], [-7, -122, -99, -15, -135, -134], [-61, -197, 45, -184, 51, 97], [53, 92, 16, 48], [-152, -140, 15, 70]]


Output: [-32, 90, 37, 50, 40, -7, 97, 92, 70]