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:
[[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

Ex Output:
[-163, 37, 98, 77, 58, 47]


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:
[[-148, -50, 29, -75], [-95, 44], [-63, -13, -1, -84, -141, 87], [-74, -124], [35, -32, -85, -47]]

Ex Output:

[29, 44, 87, -74, 35]