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:
[[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

Ex Output:
[-20, 93, 17, 91, 69, 44, -21, 98, 25]


Ex Input:
[[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]

Ex Output:
[-29, 88, 31]


Ex Input:
[[79, -7, -151], [-41, -102, 9, -170, -165, -188], [-102, -5, -13, 71, 15, -111], [-77, 69, 0, 97, 92], [-91, -21, -158, -107, -183, 84, -43], [17, 51, -133, -112, -85, -185, -61], [-162, 26, -145, 13, -48, 67, 83], [-196, 54, -133, -61, -89, -98]]

Ex Output:

[79, 9, 71, 97, 84, 51, 83, 54]