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: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

Output: [93, 57, 98, 60, 15, -64, -9]


Input: Consider Input: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]

Output: [85, -8, 67, 45, 71, 91]


Input: Consider Input: [[-45, 68, -166, -7], [-110, 17, -151, 87, -185, -162, -47], [-192, -58, -161], [-46, -123, 12], [71, -24, -58, -183, -193, -146, 1], [23, 47, -44, 46, 51, 6, -24], [-162, -39, -119, -74, 37, 34], [-33, -142, 8, -120, 51, 22, -141]]


Output: [68, 87, -58, 12, 71, 51, 37, 51]