Tomberg et al. assembled a look-up table with 238 SMARTS patterns to compare the relative strength of different DGs and determine which DG would yield the major product. This look-up table is convenient when dealing with a few molecules, but it quickly becomes cumbersome when examining lots of molecules. Thus, to make the work of Tomberg et al. more accessible, we implemented a simple program that given a SMILES string goes through all of the SMARTS patterns to find matches, sorts the matches, and returns a visual output of the result. The algorithm sequentially sorts according to the number of heavy atom matches, the sum of atomic numbers of the heavy atom matches, and the DG strength associated with the SMARTS pattern. Hence, favoring SMARTS patterns that are most specific in terms of most atom matches, patterns with atoms having higher atomic numbers (matching a nitrogen atom is given a higher priority than matching a carbon atom), and the lowest DG strength if the other two priorities are unambiguous. Figure and Table show an example of the results from running the program with "CCCN(C)C(=O)c1ccc(C(=O)c2ccccc2)cc1" as the input SMILES string. The sites marked with red indicate the predicted reaction sites.