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:
[[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]

Ex Output:
[57, 61, 36, 78]


Ex Input:
[[-74, 5, -67, 67, 24, -3], [27, -80, -129], [-164, -114], [-190, -132, -121], [-134, -139]]

Ex Output:
[67, 27, -114, -121, -134]


Ex Input:
[[-21, -149, -152, -96, -79], [46, -122, -162], [54, -75, -129, 61, 93], [-74, -12], [-7, -176, -51], [-170, -19, -75, -187], [-67, -121, -178, -167, -22], [-193, -15, -164, -142, 48, -109, 44], [-54, -82, -40, -75, -111, -13]]

Ex Output:

[-21, 46, 93, -12, -7, -19, -22, 48, -13]