UVa 10140

#include<bits/stdc++.h>
using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

typedef unsigned long long ull;
typedef long long          ll;
typedef long double        lld;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define spc                printf(" ")
#define line               printf("\n")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define clr(a,x)           memset(a,x,sizeof(a))
#define tp(v,j)            get<j>(v)
#define pb                 push_back
#define mp                 make_pair
#define mt                 make_tuple
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-6
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                (ll)2147483647
#define MAXn               (ll)50000

int GCD(int a, int b) { return b == 0 ? a : GCD(b , a % b); }
ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }

bool isprime[1000001];
vll seive()
{
    clr(isprime,true);
    isprime[0]=false;
    isprime[1]=false;
    for(int i=4;i<MAXn;i+=2) isprime[i]=false;
    for(int i=3;i*i<MAXn;i+=2){
        if(!isprime[i]) continue;
        for(int j=i*i;j<MAXn;j+=i) isprime[j]=false;
    }
    vll primes;
    primes.pb(2LL);
    for(int i=3;i<MAXn;i+=2){
        if(isprime[i]) primes.pb((ll)i);
    }
    return primes;
}

vll seg_seive(ll l,ll r,vll sprime)
{
    clr(isprime,true);
    for(int i=0; sprime[i]*sprime[i]<=r; i++){
        ll base = (l/sprime[i])*sprime[i];
        if(base<l) base+=sprime[i];
        for(ll j=base; j<=r; j+=sprime[i]) isprime[j-l]=false;
        if(base==sprime[i]) isprime[base-l]=true;
    }
    vll primes;
    for(int i=0; (ll)i<=r-l; i++){
        if(isprime[i]){
            if(i+l!=1LL) primes.pb((ll)(i+l));
        }
    }
    return primes;
}

int main()
{
    #ifdef VAMP
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    vll sprime = seive();
    ll l,r;
    while(sc("%lld %lld",&l,&r)!=EOF){
        vll primes = seg_seive(l,r,sprime);
        ll mn=MAX,mx=0LL,a,b,c,d;
        for(int i=1;i<primes.size();i++){
            ll x = primes[i]-primes[i-1];
            if(x<mn){
                mn = x;
                a=primes[i-1];
                b=primes[i];
            }
            if(x>mx){
                mx = x;
                c=primes[i-1];
                d=primes[i];
            }
        }
        if(mx) pf("%lld,%lld are closest, %lld,%lld are most distant.\n",a,b,c,d);
        else pf("There are no adjacent primes.\n");
    }


    #ifdef VAMP
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}