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.

[[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]
[-48, 37, 78, 94, -119, 79, 43, 49, 99]

[[-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]]
[-3, 50, -38, 51, 42, 54, 81, 76]

[[-32, -184], [74, -166, -44, -190, -127, 57], [-73, 91, -48, 40, -56, -190, 27], [20, -111, -121, 100, 64], [-4, -185], [-77, -100, -80], [-60, -87], [-15, -101, -98, -156, -157, -16, -72]]

[-32, 74, 91, 100, -4, -77, -60, -15]