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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

Output: [-3, 50, -38, 51, 42, 54, 81, 76]


Input: Consider Input: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]

Output: [97, -5, 47, -13, 95]


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]