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.
[[-166, -47, -160, -50, -68], [61, -31, -140, 41, -92, -10], [54, -80, 98, 8], [91, -88, -3, -107], [-89, -5, 15], [-118, -18, -81]]