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:
[[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]

Ex Output:
[85, 21, 34, 90, 81, 32, 77, 65, 97]


Ex Input:
[[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

Ex Output:
[-3, 50, -38, 51, 42, 54, 81, 76]


Ex Input:
[[-25, -30, -69, -110], [42, -186, -103], [-82, -30], [87, 10, -79, 1, 80, 99], [-106, 9, 97, -176, 49], [-68, -55, -14, -157, 43, -111]]

Ex Output:

[-25, 42, -30, 99, 97, 43]