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:
[[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]

Ex Output:
[-7, 91, 93, 86, 39, -35, 74, 72, 17]


Ex Input:
[[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]

Ex Output:
[98, 72, 48]


Ex Input:
[[-65, -100, -75, -140, 84], [-55, -46, -19, -47, -106, 74], [-125, -146, -54, -136, -47, 38], [4, -33, -119, 4], [-140, 44]]

Ex Output:

[84, 74, 38, 4, 44]