扩展中国剩余定理模板（EXCRT)

struct Node {
    LL m, b;
};
struct ExCrt {
    int n;
    Node a[Maxk + 5];

    LL exgcd (LL x, LL y, LL &a, LL &b) {
        if (y == 0) {
            a = 1, b = 0;
            return x;
        }
        LL tmp = exgcd (y, x % y, b, a);
        b -= (x / y) * a;
        return tmp;
    }
    LL Query () {
        LL m = a[1].m, b = a[1].b;
        rep (i, 2, n) {
            //x = b[1] (mod m[1])
            //x = b[2] (mod m[2])
            //b[1] + m[1] * f = b[2] + m[2] * g
            //M = lcm (m[1], m[2])
            //x = b[1] + m[1] * f (mod M)
            //m[1] * f + m[2] * (-g) = b[2] - b[1]
            LL f, g, _gcd, M;
            _gcd = exgcd (m, a[i].m, f, g);
            M = m / _gcd * a[i].m;
            f *= (a[i].b - b) / _gcd;
            f = (f % a[i].m + a[i].m) % a[i].m;
            b = (b + m * f) % M;
            m = M;
        }
        return b;
    }
}F;