LOJ 1328

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define clr(a,x)           memset(a,x,sizeof(a))
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1e9
#define MOD                1000007

ll GCD(ll a, ll b) { return b == 0 ? a : GCD(b , a % b); }
ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }

ll a[100005],cum[100005];

int main()
{
	read();
	write();

	int t;
	sci(t);
	loop(ca,1,t){
		ll k,c,n;
		sc("%lld %lld %lld %lld",&k,&c,&n,&a[0]);
		loop(i,1,n-1) a[i]=((k*a[i-1])+c)%MOD;
		sort(a,a+n);
		clr(cum,0);
		cum[0]=a[0];
		loop(i,1,n-1) cum[i]=(cum[i-1]+a[i]);
		ll sum=0LL;
		loop(i,1,n-1){
			ll x = cum[n-1]-cum[i-1];
			ll y = ((n-i)*a[i-1]);
			sum+=(x-y);
		}
		cspf(ca);
		pfl(sum);
		line;

	}
	return 0;
}