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: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]

Output: [57, 82, 5, 28, 70]


Input: Consider Input: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]

Output: [61, 28, 95, 9]


Input: Consider Input: [[-147, -11, -18, 18], [-8, 54, -165, -177, 45, -88, -163], [84, -151, -172, -189, -118, 64, 42], [22, 47, -43], [93, 87], [-104, -189, -107], [37, -80, -8, -113], [-70, -130, -143, -67]]


Output: [18, 54, 84, 47, 93, -104, 37, -67]