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: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]

Output: [49, 79, 8, 70]


Input: Consider Input: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

Output: [99, 1, 16, 19, 62]


Input: Consider Input: [[-16, -147, 57, -89, -94, -93], [-199, 43, -5, -13], [54, 70, 85, -82, 47, -97, -137], [-22, -57, 18], [46, -32, 72, -88], [0, -150, -76, -73, 89], [-190, -139, 29, -44, -131], [-151, -171], [51, -61, -153, -14, -66, -93, -91]]


Output: [57, 43, 85, 18, 72, 89, 29, -151, 51]