#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define meow(cat...) fprintf(stderr, cat)

const int M = 2520;
const int MaxN = 5e2 + 5;
const double eps = 1e-10;

double ans[MaxN], tmp[MaxN], sum[MaxN];
int n, m[MaxN], d[MaxN][MaxN], vis[MaxN][MaxN];

int gcd(int a, int b) {
    return !b ? a : gcd(b, a % b);
}

int get(int x) {
    if (x == 2 || x == 4)
        return 8;
    else if (x == 3)
        return 9;
    else
        return x;
}

inline int read() {
    int x = 0;
    char ch = getchar();

    while (ch > '9' || ch < '0')
        ch = getchar();

    while (ch <= '9' && ch >= '0')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();

    return x;
}

void calc(int r) {
    memset(vis, 0, sizeof(vis)), tmp[0] = 1;

    for (int i = 1; i <= n; i++)
        tmp[i] = 0;

    for (int i = 1; i <= 100; i++)
        sum[i] = 1;

    for (int i = 1; i <= n; i++) {
        int v = get(m[i] / gcd(m[i], M));

        if (tmp[i - 1] < eps)
            break;

        double last = sum[v];

        for (int k = 0; k < v; k++) {
            int cur = r + k * M;

            if (d[i][cur % m[i]] && !vis[v][k])
                sum[v] -= 1.0 / v, vis[v][k] = 1;
        }

        tmp[i] = tmp[i - 1] * sum[v] / last;
    }

    for (int i = 0; i <= n; i++)
        ans[i] += tmp[i];
}

signed main() {
    scanf("%d", &n);

    for (int i = 1; i <= n; i++) {
        int x = read(), r = read(), g = read();
        m[i] = r + g;

        for (int j = 0; j < r; j++)
            d[i][(j - x % m[i] + m[i]) % m[i]] = 1;
    }

    for (int i = 0; i < M; i++)
        calc(i);

    for (int i = 0; i <= n; i++)
        printf("%.15lf\n", (ans[i] - ans[i + 1]) / M);

    return 0;
}