题目描述 For any given positive integer $ n $, two positive integers $ A $ and $ B $ are called Square Friends if by attaching $ 3 $ digits to every one of the $ n $ consecutive numbers starting from $ A $, we can obtain the squares of the $ n $ consecutive numbers starting from $ B $. For example, given $ n = 3 $, $ A = 73 $ and $ B = 272 $ are Square Friends since $ 73984 = 272^2 $, $ 74529 = 273^2 $, and $ 75076 = 274^2 $. Now you are asked to find, for any given $ n $, all the Square Friends within the range where $ A \leq MaxA $. 输入格式 Each input file contains one test case. Each case gives $ 2 $ positive integers: $ n $ ($ \leq 100 $) and $ MaxA $ ($ \leq 10^6 $), as specified in the problem description. 输出格式 Output all the Square Friends within the range where $ A \leq MaxA $. Each pair occupies a line in the format $ A $ $ B $. If the solution is not unique, print in the non-decreasing order of $ A $; and if there is still a tie, print in the increasing order of $ B $ with the same $ A $. Print No Solution. if there is no solution. 输入样例 3 85 输出样例 73 272 78 281 82 288 85 293