hdu CA Loves GCD dp

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<cstring>
#include<queue>
#include<stack>
#include<list>

using namespace std;

typedef long long ll;
const int MAXN=1000;
const ll INF=1e9;
const ll mod=100000007;

int a[1002];ll num[1002];
int pp[1002][1002];

int main()
{
	//freopen("A-large.in","r",stdin);
    //freopen("A-large.out","w",stdout);
//    for (int i=0;i<=1000;i++)
//        for (int j=0;j<=1000;j++)
//            Gcd[i][j]=__gcd(i,j);
    for(int i=1;i<=1000;i++){
        for(int j=1;j<=1000;j++){
            pp[i][j]=__gcd(i,j);
        }
    }
    int t;
    cin>>t;

    while(t--){
        int n;
        cin>>n;
        int maxv=-1;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            maxv=max(maxv,a[i]);
        }
        memset(num,0,sizeof(num));
        for(int i=0;i<n;i++){
            for(int j=1;j<=maxv+1;j++){
                 if(num[j]){
                    int tmp=pp[j][ a[i] ];//__gcd(j,a[i]);
                    num[tmp]=(num[tmp]+num[j])%mod;
                 }
            }
            num[ a[i] ]++;
        }
        ll ans=0;
        for(ll i=1;i<=maxv+1;i++){
            ans=(ans+num[i]*i)%mod;
        }

        cout<<ans<<endl;

    }

	return 0;
}