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: [[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]

Output: [82, -62, 5, 98, 100, 56, 64, 54]


Input: Consider Input: [[-194, -53], [76, -105, -182, -135, -156, -156], [22, -167, -59], [95, -6, -181], [97, 39, 52, -123, -64, 33, -137], [85, 38, -56, 59, -63], [22, -26, 13, -39], [-118, -51, 91], [24, 99, 93, -169, 80, 46]]

Output: [-53, 76, 22, 95, 97, 85, 22, 91, 99]


Input: Consider Input: [[22, 47, -40, -184, -101], [-64, -108, -109, -139], [-194, -4, -93]]


Output: [47, -64, -4]