def cases(T):
  def tot(sisa):  
    left = sisa-(2*K-1)
    if left==0:
      return 1
    else:
      ttl = 0
      for i in range(left+1):
        ttl += i
      return left + (K-1)*left
    
  answer=[]
  for i in range(T):
    line = input().split()
    N = int(line[0])
    K = int(line[1])
    total = 0
    if K <= (N+1)//2:
      start = (N - (K-1)*2)
      for i in range(1,start+1):
        total+= tot(N-i+1)

    answer.append(total)
  return answer


T = int(input())
lst = cases(T)
for i in range(len(lst)):
  lst[i]%=100003
  print(lst[i])