please tell me what is a logic of this question
I don't under stand how to solve this question
Imagine you have a floor of size n × m and you are given tiles of size 1× m. Now there are many possibilities for you to cover the entire floor using any number of such types of tiles. You need to calculate the total number of possibilities. Since in such type of questions, the answer may be too large to fit into any data type so we ask you to print the answer modulo some prime number(i.e. 10^9+7). Eg. If you have n = 2 and m = 2 then you’ve got 2 possible ways which are
1] Either place 2 tiles vertically
2] Or place 2 tiles horizontally