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: [[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]

Output: [100, 71, 38, 11, -1, 13, 79, 30]


Input: Consider Input: [[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]

Output: [95, 98, 86]


Input: Consider Input: [[71, -63], [7, 72, -163], [-54, -121, -33, -166, -22, -163], [-197, -176, -102, 12, -43], [-90, -138, 97, 4, -168, -200], [37, -105, -70, -76, -186, -100]]


Output: [71, 72, -22, 12, 97, 37]