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:
[[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Ex Output:
[29, 63, 12, 34]


Ex Input:
[[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]

Ex Output:
[55, -15, 19, 99, 91, 85]


Ex Input:
[[43, -173, -89, -186, -20, 67], [-149, 29, -58, -47], [-193, -116, -58], [52, -83, -174, -153, -175, -177, -99], [30, -121, 9, 28, 14, -120, -7], [-189, -28, -57], [-132, -52, -195, -6, 64], [-95, 1, -188, 9, 13, -95]]

Ex Output:

[67, 29, -58, 52, 30, -28, 64, 13]