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:
[[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

Ex Output:
[79, 65, -87, 89, -2, -13, 20, -184]


Ex Input:
[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

Ex Output:
[41, -44, 34, 86, 26]


Ex Input:
[[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

Ex Output:

[75, 51, 10, 53, -43, 17, -111]