import sys
import collections
import math
t=int(input())
n = 4
binary = format(n, 'b')
n = int(binary, 2)
def CountFrequency(my_list):
freq = {}
for item in my_list:
if (item in freq):
freq[item] += 1
else:
freq[item] = 1
return freq
for i in range(t):
list = input().rsplit(" ")
n = int(list[0])
x = int(list[1])
ans=0
i = 1
ji = 0
while(ji*ji<=n):
ji=ji+1
ji=ji-1
while(i*i<=n and i<=x):
j = 1
while(j*j<=n):
p1 = (n-i*j)//(i+j)
p1 = max(0,p1)
p2 = x-i-j
p2=max(0,p2)
p2=min(p1,p2)
ans=ans+p2
if(p2>=ji):
ans=ans+(p2-ji)*2
j=j+1
i=i+1
print(ans)
752. Open the Lock | 1535A - Fair Playoff |
1538F - Interesting Function | 1920. Build Array from Permutation |
494. Target Sum | 797. All Paths From Source to Target |
1547B - Alphabetical Strings | 1550A - Find The Array |
118B - Present from Lena | 27A - Next Test |
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |