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: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]

Output: [8, -11, -47, 24, 61, -67, -11, 70, 10]


Input: Consider Input: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]

Output: [0, 22, 17, 48, 80]


Input: Consider Input: [[55, 42, 90, -146], [-164, 82, 84], [-24, 36, -16, -127, -134], [-47, 39, -148, -118, -193]]


Output: [90, 84, 36, 39]