SOLVE

LATER

Valentine Time <3

Problem

Editorial

Analytics

It's Valentine Time . Love is in Air . So, Mr. Pole is looking for bride . For becoming his bride , there is only one criteria. She should be expert in Coding . So, Mr.Pole has given a question for 1st Elimination round :

Given a range L and R , you have to tell the number between L and R such that **difference between no. of divisors and prime divisors is maximum**. If two number has same difference , print the smallest one .

**Input** : First line contains T , denoting number of Test cases
Next T lines contains L and R denoting the range for the query.

**Output** : Print the desired result in each line.

**Constraints :**

1<=T<=10

1<=L<=R<=10^6

**AUTHOR** : trico

Time Limit:
5.0 sec(s)
for each input file.

Memory Limit:
256 MB

Source Limit:
1024 KB

Marking Scheme:
Marks are awarded when all the testcases pass.

Allowed Languages:
C,
C++,
C++14,
Clojure,
C#,
D,
Erlang,
F#,
Go,
Groovy,
Haskell,
Java,
Java 8,
JavaScript(Rhino),
JavaScript(Node.js),
Julia,
Lisp,
Lisp (SBCL),
Lua,
Objective-C,
OCaml,
Octave,
Pascal,
Perl,
PHP,
Python,
Python 3,
R(RScript),
Racket,
Ruby,
Rust,
Scala,
Swift,
Visual Basic,
Kotlin

Initializing Code Editor...

{"0e49e84": "/pagelets/problems-hint/algorithm/mantu-dummy/", "0e49e31": "/pagelets/show-submission/algorithm/mantu-dummy/", "0e49e99": "/pagelets/recommended-problems/algorithm/mantu-dummy/", "0e49e6f": "/pagelets/problem-author-tester/algorithm/mantu-dummy/", "0e49e57": "/pagelets/suggested-problems/algorithm/mantu-dummy/"}

{}

realtime.hackerearth.com

80

7e9bbb757edaa142052eb792ea1c37d040f9623f

58a29e5cae2309f04b28

/realtime/pusher/auth/