<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def print_splits(cliques, next_cliques):
 """Print shifts for new forks."""

    splits = 0
    for i, clique in enumerate(cliques):
        parent, _ = clique

        # If this fork continues
        if parent in next_cliques:
            # If there is a new fork, print a split
            if len(next_cliques[parent]) > 1:
                print_split(i + splits, len(cliques) + splits)
                splits += 1