B'For given n, l and r find the number of distinct geometrical progression, each of which contains n distinct integers not less than l and not greater than r. In other words, for each progression the following must hold: l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r and ai xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89aj , where a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an is the geometrical progression, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i, xe2 x80 x89j xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n and i xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89j. Geometrical progression is a sequence of numbers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an where each term after first is found by multiplying the previous one by a fixed non-zero number d called the common ratio. Note that in our task d may be non-integer. For example in progression 4, xe2 x80 x896, xe2 x80 x899, common ratio is . Two progressions a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an and b1, xe2 x80 x89b2, xe2 x80 x89..., xe2 x80 x89bn are considered different, if there is such i (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) that ai xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89bi. The first and the only line cotains three integers n, l and r (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89107, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89107). Print the integer K -- is the answer to the problem. These are possible progressions for the first test of examples: These are possible progressions for the second test of examples: These are possible progressions for the third test of examples: These are possible progressions for the fourth test of examples: '...