Could someone explain in detail how to solve [this](https://www.hackerrank.com/contests/hourrank-21/challenges/sams-numbers)↵
problem. THhe editorialist talks about matrix exponentiation. I know how to apply this when we solve linear equation, like F(N) for fibonacci series. But here we want to apply it on dp[i][j] where dp[i][j] = number of lists whose sum is i and last number is j. How we solve it.
problem. T
