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: [[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]

Output: [70, 56, -22]


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: [[-186, 46, -192, -83, -74, -139, -50], [-123, -54, -10, 2, 8, -80, -53], [-182, -146, 43, -128], [84, 17, 57, -198, -108, -33, 26], [9, -28, -21, -114, 33, -191, 20], [-28, 54], [-117, -194, 64, -3, 36, -89], [-78, 45, -70, 12], [-134, -120, 27, -12, -48, 97, 99]]


Output: [46, 8, 43, 84, 33, 54, 64, 45, 99]