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: [[14, -199], [-96, -75, -1, -54, -147, 98, 70], [2, 49, -99, -98, 48], [45, -143, -123, 36, 77, -115, -27], [-102, -120, -166], [69, -52, -1, -104], [-72, -135], [-77, 69, -114], [-47, -151, -82, -73, 92, -19]]

Output: [14, 98, 49, 77, -102, 69, -72, 69, 92]


Input: Consider Input: [[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

Output: [45, 86, 75]


Input: Consider Input: [[-98, -169, -31, 57, 88, -9, -162], [11, -6, -31, 20, -191], [-35, -50, 27, -100, -131, -32, -39], [-21, -78, -60, -121, -88, -88, 38], [-151, 72, 70], [14, -137, -67], [-61, 28, -37], [-60, 0], [25, -126, 39, -171]]


Output: [88, 20, 27, 38, 72, 14, 28, 0, 39]