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.

Ex Input:
[[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

Ex Output:
[79, 56, -1, 85, 89, 61, -62, 31]


Ex Input:
[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

Ex Output:
[96, 48, 65, 19, -26, 95, -11]


Ex Input:
[[-164, 67, 93, 93], [25, 6, -94, -124, -16, -8, -168], [-99, 32, 86], [14, -34], [-152, -139, -39, -15, -104], [-78, -162, -171, -61], [-42, -88, -70, -163, -147, -56], [-27, -2, 83], [-67, 50, -176, 64]]

Ex Output:

[93, 25, 86, 14, -15, -61, -42, 83, 64]