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: [[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]

Output: [65, 67, 98, 47, 76, -16, 91, 64]


Input: Consider Input: [[52, -72], [-90, -59, -53, -180], [13, -64, -153], [-149, -38, 7, 61, 93, 1]]

Output: [52, -53, 13, 93]


Input: Consider Input: [[6, -41, -74], [-63, -10], [-101, -46]]


Output: [6, -10, -46]