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: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Output: [29, 63, 12, 34]


Input: Consider Input: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]

Output: [97, 45, 26, -42, 45, 44, 27, -42]


Input: Consider Input: [[-47, -25, 19, -169], [-45, -39, 97, 29, -68, 67, 65], [79, -26, -109, -20]]


Output: [19, 97, 79]