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.

[[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[46, 34, 80, 76, 68]

[[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]
[90, -4, 18]

[[-28, -119, 61, 35], [-26, -105, -119, -144], [-67, -42, -129, -197, -165], [-14, -26, 82, -154, -24, -160, -195], [-46, -91, -144, -196, -21]]

[61, -26, -42, 82, -21]