Given the task definition and input, reply with output. 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.

[[60, -164, -86, 32, -132, -199, -81], [15, 16, -136, -80, -166, -129], [72, 99, -108, -163]]

[60, 16, 99]