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:
[[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]

Ex Output:
[77, 88, 86, 78, 99, 83, 95, 59, 96]


Ex Input:
[[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]

Ex Output:
[82, -62, 5, 98, 100, 56, 64, 54]


Ex Input:
[[-53, -73, -82, 33, 27], [97, -191, -108, -169, -5, -166], [-28, -53, 55, -29, -159, -117], [-103, -167], [27, -179, 85, -44, -100]]

Ex Output:

[33, 97, 55, -103, 85]