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: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]

Output: [90, 94]


Input: Consider Input: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

Output: [92, 50, -48, 70, 50, 30, 14, 7, 62]


Input: Consider Input: [[-16, -18, 80], [-9, 72, -134, -91, -45, 44], [-5, -127, 49, -11, -180, -179, -185], [-90, -176, -17, -57, 99], [-16, -108, 43], [80, -29, -38, 46, -42, -117, 88], [89, -33, 10, -61, -97, -65], [21, 18, -38, -69]]


Output: [80, 72, 49, 99, 43, 88, 89, 21]