Airport has m runways of length n units.
The rules of game are as follows:
One can start at any runway.
One can switch from ith runway to jth runway if (i, j) are coprime.
It is compulsory to switch between runway after every 1 unit.
One has to reach end of runway.
Find number of ways in which this can be achieved. As answer could be large, print it modulo 1000000007.
1<=n<=1000000000
1<=m<=10
Plz help me in this question.