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:
[[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]

Ex Output:
[100, 71, 38, 11, -1, 13, 79, 30]


Ex Input:
[[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

Ex Output:
[75, 57, 75, 20, -95, 20]


Ex Input:
[[0, 75, -59, -53, -126, -24], [-149, -50], [-8, -66, 12, -128, -164, -14], [-179, -38, -75, -104, -177], [-97, -112, -132, -24, -12, 17, -148], [5, 88, -18, 98, 25], [98, 71, -196, -153, -18, -87, -71], [-190, -139, -160, -95], [-168, 13, 52, 96, 5, -197]]

Ex Output:

[75, -50, 12, -38, 17, 98, 98, -95, 96]