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.
[[61, 38, -69, 39], [86, -106, 37, -122, -77, -136], [-199, -52, -53, 55, 48, -168], [-100, 3], [1, 19, 30, 57, 6, -44, -87]]