output_description: Print Q lines.
  
  In the i-th line, print the answer for the i-th query.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      Q
      x_1 d_1 n_1
      :
      x_Q d_Q n_Q
attempt: n = int(input())
  for j in range(n):
      import numpy
  
      a = list(map(int, input().split(" ")))
      b = []
      for i in range(a[2]):
          b.append(a[0] + ((i - 1) * (a[1])))
      result = numpy.prod(b)
      print(result % 1000003)
  
problem_description: Statement
  
  Consider the following arithmetic progression with n terms:
  
    * x, x + d, x + 2d, \ldots, x + (n-1)d
  
  What is the product of all terms in this sequence? Compute the answer modulo
  1\ 000\ 003.
  
  You are given Q queries of this form. In the i-th query, compute the answer in
  case x = x_i, d = d_i, n = n_i.
samples: [{"input": "2\n    7 2 4\n    12345 67890 2019", "output": "9009\n    916936\n    \n\nFor the first query, the answer is 7 \\times 9 \\times 11 \\times 13 = 9009.\nDon't forget to compute the answer modulo 1\\ 000\\ 003."}]