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: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]

Output: [-110, 37, 0, 24]


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: [[86, -120, 29, 60, -154, -64, -196], [8, -155, -132, -101, -155, -29, -53]]


Output: [86, 8]