It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp
which summons a powerful Genie. Here we are concerned aboutthefirst mystery.
Aladdin was aboutto enter to a magical cave, led bythe evil sorcerer who
disguised himself as Aladdin's uncle, found a strange magical flying carpet atthe
entrance. There were some strange creatures guarding the entrance ofthe cave.
Aladdin could run, but he knew that there was a high chance of getting caught. So,
he decided to use the magical flying carpet. The carpet was rectangular shaped, butnot square shaped. Aladdin took the carpet andwiththe help ofit he passed the
entrance.
Now you are giventhe area ofthe carpet andthelengthofthe minimum possible
side ofthe carpet, your task isto find how many types of carpets are possible.
For example, the area ofthe carpet 12, andthe minimum possible side ofthe carpet
is2, then there can be two types of carpets and their sides are: {2, 6} and {3,
4}.
【Input】
Input starts withaninteger T (≤ 4000), denoting thenumberof test cases.
Each case starts withaline containing two integers: a b (1 ≤ b ≤ a ≤ 10^12) where
a denotes the area ofthe carpet and b denotes the minimum possible side ofthe
carpet.
【Output】
For eachcase, print thecasenumberandthenumberof possible carpets.