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: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]

Output: [100, 3, 97]


Input: Consider Input: [[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]

Output: [100, 71, 38, 11, -1, 13, 79, 30]


Input: Consider Input: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]


Output: [86, 46, -128, 81, 40, 67]