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:
[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]

Ex Output:
[65, 67, 98, 47, 76, -16, 91, 64]


Ex Input:
[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

Ex Output:
[-33, 49, 37, -34, 92, 57, 19, 72, -92]


Ex Input:
[[-180, 21], [33, -80, 14, -43, -84, 14], [-105, -186, -16, -48, -117, -72], [93, -69, -138, 80, -115, 7, -108], [-185, 5]]

Ex Output:

[21, 33, -16, 93, 5]