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: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]

Output: [-21, 86, 29, 100]


Input: Consider Input: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

Output: [95, -53, 27]


Input: Consider Input: [[-90, 13], [72, -44, -152, -63], [-88, -54, -67, -1, -11, -144, -64], [69, -137, 35, -132, -70, 37], [-110, 95, -176], [-104, -1, -73], [-51, 88, 19], [-41, -140, 51]]


Output: [13, 72, -1, 69, 95, -1, 88, 51]