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:
[[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]

Ex Output:
[14, -43, -3, 14, 56, 61, -19, 97, -14]


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:
[[-43, -17, -113], [96, 16, -152, 93, -125, -109, -5], [-170, 15, 67, 41, -123, -121], [-79, -153, -97, -20, -24], [-142, 52, 98, -118, 78, -128], [-44, 26, 10, -95, -118], [20, -120, -28, -160, -55]]

Ex Output:

[-17, 96, 67, -20, 98, 26, 20]