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.
[[68, -31, -11, 48], [-163, -17, 81, -63, -185, 83, -111], [-130, -12, -118, 43, -79, -174, -175], [89, 11, 91, -105, -168]]