You have a grid of size **n x m** and you want to paint each cell of the grid with exactly one of the three colors: **Red, Yellow, or Green** while making sure that no two adjacent cells have the same color (i.e., no two cells that share vertical or horizontal sides have the same color).\n\nGiven n the number of rows of the grid, return the number of ways you can paint this grid. As the answer may grow large, the answer must be computed modulo 10^9 + 7.\n\nConstraints - \n\n**m <= 6**\nn <= 5000\n\nExample - \n\n1. n = 1, m = 3\n    result = 12\n\t\n2. n = 2, m = 3\n    result = 54\n\t\n3. n = 5, m = 5\n    result = 580986\n\t\nSimilar to [Number of Ways to Paint N \xD7 3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/)

You have a grid of size n x m and you want to paint each cell of the grid with exactly one of the three colors: Red, Yellow, or Green while making sure that no 