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: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]

Output: [67, 85, 90, 76, 81, 98, 94]


Input: Consider Input: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

Output: [91, -49, 89, 83, 92, -91]


Input: Consider Input: [[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]


Output: [92, 28, 99, 15]