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:
[[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

Ex Output:
[32, 26, 72, 53, 75, 58, 92, 44]


Ex Input:
[[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

Ex Output:
[9, -5, 62, -35, 92, -30, 91]


Ex Input:
[[-60, 71, -103], [-98, 40, 75, -26, -67], [49, -172, -124], [6, 64], [-103, 46, -55, -106, -182], [-122, 49, -80, 28, 78, -157], [37, -7, -97, 65, 12, 89, -75], [-90, -139, -161, 31]]

Ex Output:

[71, 75, 49, 64, 46, 78, 89, 31]