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, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]

Output: [11, 11, 35, 82, 48, 95, 2, 0, -115]


Input: Consider Input: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

Output: [-33, 49, 37, -34, 92, 57, 19, 72, -92]


Input: Consider Input: [[-142, -47, -88, 81, -182], [24, -158, -60, -72, -97, -59], [-182, -125, -146, -142, -69, -149, -107], [67, -97, -3, -150, -147]]


Output: [81, 24, -69, 67]