In a $3 \times 4$ grid of 12 squares, find the number of paths from the top left corner to the bottom right corner that satisfy the following two properties: - The path passes through each square exactly once. - Consecutive squares share a side. Two paths are considered distinct if and only if the order in which the twelve squares are visited is different. For instance, in the diagram below, the two paths drawn are considered the same.