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.

[[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]
[99, 54, 32]

[[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]
[53, 64, -34, 92, 22, 82, 85, 81, 43]

[[-39, -180, -166, -168, -42, -94], [-196, -68, -199, 44, 54, -123], [17, -38, -165], [85, -54, -15, -59, -168, 4, 64], [-177, -119, -18, -28, 81], [-182, -91, -115, 92], [-119, -30, -8, -110, -37]]

[-39, 54, 17, 85, 81, 92, -8]