from typing import List


def trace_table(backtrack_table, seq1, seq2) -> List[str]:
    """Trace back the backtrack table to find the longest common subsequence"""
    i, j = len(seq1)-1, len(seq2)-1
    lcs = []

    while i >= 0 and j >= 0:
        dx, dy = backtrack_table[i][j]
        if dx + dy == -2:
            lcs.append(seq1[i])
            # break
        i += dx
        j += dy
    return lcs[::-1]