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: [[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]

Output: [55, 94, 89, 30, 77, 87]


Input: Consider Input: [[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]

Output: [-43, 100, 61, 82, -28, 42]


Input: Consider Input: [[-69, -138, -109], [-108, -160, -169, -121, 10], [-28, -166, 35, 81, -159], [-166, -187, 67, 59, -86, -78], [-140, -185], [24, -11], [-179, -36, -8], [-69, -191, 44, -109, 18]]


Output: [-69, 10, 81, 67, -140, 24, -8, 44]