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: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]

Output: [83, 59, 65, 56, 83, 99, 98, 15, 82]


Input: Consider Input: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

Output: [91, 53, 82, -9]


Input: Consider Input: [[-55, -96, -105, 3, -13, -53, -194], [38, -42], [-87, -104, -128, -122, -41], [76, 86, -40], [-169, 27, -186], [-69, 53, -39, 49, -12, -18, 91], [-200, -48, -141, 2, -94, -112, 79]]


Output: [3, 38, -41, 86, 27, 91, 79]