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:
[[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

Ex Output:
[90, -4, 18]


Ex Input:
[[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]

Ex Output:
[46, 34, 80, 76, 68]


Ex Input:
[[-131, 72, -116, -93], [-26, -19, -174, -56, 16, -192, -78], [-65, -51, -108], [-47, -12, -190, 47, -72, 48, 79], [7, 53, -20, -7]]

Ex Output:

[72, 16, -51, 79, 53]