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: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

Output: [-20, 93, 17, 91, 69, 44, -21, 98, 25]


Input: Consider Input: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

Output: [90, 98, 22, 85, 64, 77, 63, -152]


Input: Consider Input: [[27, -6, -147, -197, -105], [-199, 51, 41, -61, 50, 16], [29, -75, 6, -30, -77, -18], [27, -88, -22, -152, -26, -80, -9], [-17, -35, -88, -52, -38, -72], [72, -191], [-58, 48, -53, -27], [-66, 0, -144, 93], [-162, 19, -171, -112, 57, 22]]


Output: [27, 51, 29, 27, -17, 72, 48, 93, 57]