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:
[[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]

Ex Output:
[49, 24, -92, 80, 19, 93, 100, 42, 84]


Ex Input:
[[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]

Ex Output:
[-4, 37, 90, 60, 55, 53, 83]


Ex Input:
[[-49, -105, 90, 82], [85, -105, 95, -78, 33, -21], [-132, -80, 19, -190, -110, 59], [-198, -97, 85], [-8, -139, -25, 64, 84]]

Ex Output:

[90, 95, 59, 85, 84]