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:
[[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

Ex Output:
[45, 17, 92, 12, 28, 8, -93]


Ex Input:
[[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]

Ex Output:
[-4, 37, 90, 60, 55, 53, 83]


Ex Input:
[[-71, -65, 14, -15, 39, 64, -52], [-170, -187, 14, 21], [-44, 22, 88], [-55, 38, 77, -44, 88, -187], [42, -148], [-131, -115, -142, 49], [64, -168, -183, -77, -170, -61], [-62, -102, 80, 9, 35, -119], [-89, -128, -183, -147]]

Ex Output:

[64, 21, 88, 88, 42, 49, 64, 80, -89]