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.

Q: [[79, 50], [90, 81, -105]]

A: [79, 90]
****
Q: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]

A: [-137, 8, 71, 30, 12]
****
Q: [[-126, -41], [-151, 10, -95, -21, -17], [-41, 44, -184, 72, -128], [-95, 40, -188, 63], [59, -68, -175, 89, -90, 6], [-48, -84, -147, -89], [-38, -144], [-144, -182, 4, -169, -26, 94]]

A:
[-41, 10, 72, 63, 89, -48, -38, 94]
****