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: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

Output: [48, -87, 96, 54, 91, 58, -23]


Input: Consider Input: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

Output: [11, 41, 90, 72, 34, 56, 91, -133]


Input: Consider Input: [[64, -169, 100], [-159, -138, -27, -46, 68], [-143, -195], [-11, -21, -10, 79, -131], [100, -129, -180, 24], [-147, -6, -36, 24, -15, -73, -117], [62, -26, -104, -187], [67, 66]]


Output: [100, 68, -143, 79, 100, 24, 62, 67]