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: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]

Output: [-105, 97, 59, 80, -47, -51, 9, 70, 81]


Input: Consider Input: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]

Output: [81, -36, 35, 65, 59, -31, 33, 89, 98]


Input: Consider Input: [[-159, -28], [96, 16], [-45, -167, -128, -62], [-169, 45], [25, -126, -73, -72, -61, -103, -108], [45, 57, 50, -88]]


Output: [-28, 96, -45, 45, 25, 57]