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: [[56, -4, -191, -182], [47, -70, -154], [-16, -195, -67, -196, -12]]

Output: [56, 47, -12]


Input: Consider Input: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

Output: [-92, 90, 8, 74, -126, 6, 7, -86]


Input: Consider Input: [[-200, 11, 2, -33, 29, 38], [55, -160], [-197, -181, 45, 60, -141], [-170, -90, -54, 44, -192, 39, 88]]


Output: [38, 55, 60, 88]