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:
[[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]

Ex Output:
[-47, 0, -11, 6, 85, 50]


Ex Input:
[[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

Ex Output:
[67, 26, 7, -16, 78, 79, 4, 85, 35]


Ex Input:
[[73, -76, -84, -181, -36, -137, -165], [-15, -140, -160, 47, -65, -1, -136], [-114, -93, -56, 67], [-113, -128, -134, -192], [81, 58], [48, -42, 84], [-93, 80, -182, -37], [23, -95, -78, 73, 39]]

Ex Output:

[73, 47, 67, -113, 81, 84, 80, 73]