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.

[[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]
[70, 56, -22]

[[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[-57, 95, 65, -1, 100, 55, 31, 94]

[[-159, -44], [-59, -183, 57, -155, -92, 100, -10], [71, -47, -90]]

[-44, 100, 71]