tjut 3049

#include <cstdio>    typedef long long LL;    const int MOD = 1000003;  const int MAXN = 40000 + 10;    int N, kase;  LL sum;  int pow2[MAXN];    void GetPow2()  {      pow2[0] = 1;      for (int i = 1; i < MAXN; ++i)      {          pow2[i] = (pow2[i - 1] << 1) % MOD;      }  }    void Read()  {      int n;        sum = 0;      scanf("%d", &N);      for (int i = 0; i < N; ++i)      {          scanf("%d", &n);          sum = (sum + pow2[n]) % MOD;      }  }    void gcd(LL a, LL b, LL& d, LL& x, LL& y)  {      if (!b)      {          d = a;          x = 1;          y = 0;          return;      }      else      {          gcd(b, a % b, d, y, x);          y -= a / b * x;      }  }    LL Inv(int a, int n)  {      LL ret, d, y;        gcd(a, n, d, ret, y);        return d == 1 ? (ret + n) % n : -1;  }    void Solve()  {      LL ret;      LL inv = Inv(N, MOD);      ret = sum * inv % MOD;      printf("Case %d:%I64d\n", ++kase, ret);  }    int main()  {      int T;        kase = 0;      GetPow2();      scanf("%d", &T);      while (T--)      {          Read();          Solve();      }        return 0;  }