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:
[[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

Ex Output:
[89, 47, 19, -36]


Ex Input:
[[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

Ex Output:
[93, 17, 78, 84, 35]


Ex Input:
[[98, -73, -64, -32, 58, 94], [-11, 42, -11, 95, -34], [-170, -55, -102, 45, -186, 87, -126], [-11, -101], [46, -164, -107], [-184, -167, -100], [67, -61, 50, 69], [-177, -122, 29, -65, 50, 72, -42], [-57, 60]]

Ex Output:

[98, 95, 87, -11, 46, -100, 69, 72, 60]