#include <iostream>
#include <queue>
#include <deque>
#include <vector>
#include <time.h>

#define MOD 20090711

using namespace std;

struct makeInput{
    int a, b, rng;
    makeInput(int _a, int _b):a(_a), b(_b), rng(1983){}
    int getNext(){
        int temp = rng;  
        rng = (rng*(long long)a+b)%MOD;
        return temp;
    }
};

class RUNNINGMEDIAN{
public:
    void input();
    void getMedi();
    void Run();
private:
    int count;
    int n, a, b;
    long long rng;
    long long result;

};

void RUNNINGMEDIAN::input(){
    result = 0;
    cin >> n >> a >> b;
}


void RUNNINGMEDIAN::getMedi(){
    priority_queue<int, deque<int>> first;
    priority_queue<int, deque<int>, greater<int>> second;
    makeInput m(a, b);

    for(int i=0;i<n;i++){
        if(first.size() == second.size())
            first.push(m.getNext());
        else 
            second.push(m.getNext());

        if(!second.empty() && (first.top() > second.top()) ){
            int a = first.top(), b = second.top();
            first.pop(); second.pop();
            first.push(b); second.push(a);
        }

        result = (result + first.top())%MOD;
    }
}

void RUNNINGMEDIAN::Run(){
    clock_t s, e;
    cin >> count;
    while(count--){
        input();
        s = clock();
        getMedi();
        cout << result << endl;
        e = clock();
        printf("%f sec\n",(float)(e-s)/CLOCKS_PER_SEC);
    }
}

int main(){
    RUNNINGMEDIAN().Run();
    return 0;
}