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.

[[-154, -106, -158, 36, 91, -3, -98], [-49, -85, 23, 14, -170, -169, -170], [-177, -51, -192, -57, 64, 83, -173]]
[91, 23, 83]

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

[[-14, -108, 72, -33, -27, 82], [51, 42, 85, 7, -173, -156], [36, -60, 1, -67, -84, -67], [-115, -107, -120, -199, -109, -73, -200], [-92, -66, -84, -166, -173, -17, -24], [100, 66], [-176, -26, 76]]

[82, 85, 36, -73, -17, 100, 76]