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:
[[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

Ex Output:
[85, 82, 95, -111, 24, -112, 65, 65, 16]


Ex Input:
[[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]

Ex Output:
[10, 83, 86, 22]


Ex Input:
[[-155, -52, -189, 30, 98, -149], [-44, 72, 39, -22, -34, -39, -61]]

Ex Output:

[98, 72]