codeforces round 22 B.The Golden Age(枚举)

B. The Golden Age

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Unlucky year in Berland is such a year that its number n can be represented as n = xa + yb, where a and b are non-negative integer numbers.

For example, if x = 2 and y = 3 then the years 4 and 17 are unlucky (4 = 20 + 31, 17 = 23 + 32 = 24 + 30) and year 18 isn't unlucky as there is no such representation for it.

Such interval of years that there are no unlucky years in it is called The Golden Age.

You should write a program which will find maximum length of The Golden Age which starts no earlier than the year l and ends no later than the year r. If all years in the interval [l, r] are unlucky then the answer is 0.

Input

The first line contains four integer numbers x, y, l and r (2 ≤ x, y ≤ 1018, 1 ≤ l ≤ r ≤ 1018).

Output

Print the maximum length of The Golden Age within the interval [l, r].

If all years in the interval [l, r] are unlucky then print 0.

Examples

input

2 3 1 10

output

1

input

3 5 10 22

output

8

input

2 3 3 5

output

0

Note

In the first example the unlucky years are 2, 3, 4, 5, 7, 9 and 10. So maximum length of The Golden Age is achived in the intervals[1, 1], [6, 6] and [8, 8].

In the second example the longest Golden Age is the interval [15, 22].

思路 枚举出所有小于R的X的N次方和Y的N次方最多才100个所以连个数组可以存下

然后两个数组暴力求和求出所有不幸运的日期，然后扫一遍数组找到最大集合便可以

几个坑的地方 ：1.用库函数sort的cmp函数排数组的时候如果数组里面有longlong的数 cmp参数应该传longlong

  2.最后找的时候如果没有不幸运的日期 要用r-l+1

          3.判断下一个N次方大不大于R不能直接判断因为999999999999999999999的平方会爆掉，所以要用一个变量反着来判断用R一直去 除X如果不为0那个继续存

#include<iostream>
#include<cstdio>
#include <algorithm>

using namespace std;
bool cmp(long long a,long long b){return a<b;}
long long a[10000];
long long b[10000];
long long c[120120];
int main()
{
    long long x,y,l,r;
    cin>>x>>y>>l>>r;
    long long i,j;
    long long d;
    d = r;
    int lena = 1,lenb = 1;
    a[0] = b[0] = 1;
    for(i = 0;;i++){
        long long temp = d/x;
        if(temp>0){
            a[lena] = a[lena-1]*x;
            lena++;
            d = d/x;
        }
        else
        {
            break;
        }
    }
    d = r;
    for(i = 0;;i++){
        long long temp = d/y;
        if(temp>0){
            b[lenb] = b[lenb-1]*y;
            d = d/y;
            lenb++;
        }
        else
        {
            break;
        }
    }
    int k=0;
    for(i = 0;i<lena;i++)
        for(j = 0;j<lenb;j++)
    {
        if((a[i]+b[j])>=l&&(a[i]+b[j])<=r)
            c[k++] = a[i]+b[j];
    }
    sort(c,c+k,cmp);

    long long ans = 0;
    if(k>0)
    {
         if(c[0]-l>ans)
            ans=c[0]-l;
        if(r-c[k-1]>ans)
            ans=r-c[k-1];
        for(int i=1;i<k;i++)
            ans=max(ans,c[i]-c[i-1]-1);
    }
    else
        ans=r-l+1;
    cout<<ans<<endl;
    return 0;
}