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:
[[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

Ex Output:
[93, 7, 60]


Ex Input:
[[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]

Ex Output:
[43, 72, 10, 92, 85, -104, 41, 19]


Ex Input:
[[12, 69], [58, 82, -75, 73, 12, 89, -168], [-133, -67, 30, 60, 37, 70], [-106, -122, 6, -171], [-166, 60, -94, -25, -129, -30], [-74, -18], [-139, 5, -36, -60, -108, -175]]

Ex Output:

[69, 89, 70, 6, 60, -18, 5]