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.
[[78, 81], [16, -45], [-143, 3, 60, -110, -123], [96, 51, -91, -22], [-68, 9, -47, -11, -106], [-23, -76, -60, -56]]