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: [[92, -175], [-99, -116]]

Output: [92, -99]


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: [[100, 28, -34, -159], [-198, -153, -177, -108, -163, 21, -168], [-51, 93]]


Output: [100, 21, 93]