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: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

Output: [82, -35, 37, 86, 1, 46, 99]


Input: Consider Input: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

Output: [25, 59, -59, 90, 68, -84]


Input: Consider Input: [[-140, 24, -113, 29, -110, 12], [-78, -123], [41, 27, -10], [-152, -74, 28], [-105, -81, 70, -117, -43], [73, -172, -31, -94], [-101, -32]]


Output: [29, -78, 41, 28, 70, 73, -32]