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: [[32, -123, -10, 6, -98, 4], [15, 50, -54, 45], [-61, 15, -5, 44, -72], [68, -119, -177, -73]]
A: 
[32, 50, 44, 68]