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.
[[39, -163, -28], [-28, -157, -19, -8, -178, 20], [7, -168, 81], [-173, -121, -119], [-65, -170, -39, 44, -124], [-109, 13, 12, -181, -161, -16]]