#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int N = 500 + 5; 
using ll = long long ; 
using pi = pair <int, int> ;

mt19937 rnd(1232435);

int d, n; 
double x[N][N], v[N], r[N];
double base[N][N];
double a[N][N];
double X[N];
using db = double;
using sol = std::vector<db>;
using vd = sol;
int bc = 0;
void getans() {
    sol init(bc);
    vd z(d + 1);
    for(int i = 0;i <= d;++i) z[i] = X[i];
    auto eval = [&](sol x) {
        vd vec = z;
        for(int i = 0;i < bc;++i) {
            for(int j = 0;j <= d;++j) {
                vec[j] += base[i][j] * x[i];
            }
        }
        db sum = 0;
        for(int i = 0;i < d;++i) {
            sum += vec[i] * vec[i];
        }
        sum -= vec[d];
        return sum;
    };
    db rate = 1e5;
    for(int i = 0;i < bc;++i) {
        db sum = 0;
        for(int j = 0;j <= d;++j) {
            sum += base[i][j] * base[i][j];
        }
        sum = sqrt(sum);
        for(int j = 0;j <= d;++j) {
            base[i][j] /= sum;
        }
    }
    for(int i = 0;i < 100000;++i) {
        // std::cerr << init[0] << ' ' << eval(init) << '\n';
        if(i % 17 == 0 && eval(init) < -1) break;
        sol grad(bc);
        vd vec = z;
        for(int i = 0;i < bc;++i) {
            for(int j = 0;j <= d;++j) {
                vec[j] += base[i][j] * init[i];
            }
        }
        for(int i = 0;i < bc;++i) {
            for(int j = 0;j < d;++j) {
                grad[i] += vec[j] * 2 * base[i][j];
            }
            grad[i] -= base[i][d];
        }
        db sg = 0;
        for(int j = 0;j < bc;++j) {
            sg += grad[j] * grad[j];
        }
        sg = sqrt(sg);
        for(int j = 0;j < bc;++j) {
            init[j] -= grad[j] / sg * rate;
        }
        rate *= 0.997;
    }
    sol l = init, r = init;
    for(;eval(r) < 0;) {
        for(int j = 0;j < bc;++j) {
            r[j] += l[j] + 1;
        }
    }
    for(int i = 0;i < 200;++i) {
        sol mid = l;
        for(int j = 0;j < bc;++j) {
            mid[j] = (mid[j] + r[j]) / 2;
        }
        if(eval(mid) >= 0) {
            r = mid;
        } else {
            l = mid;
        }
    }
    vd vec = z;
    for(int i = 0;i < bc;++i) {
        for(int j = 0;j <= d;++j) {
            vec[j] += base[i][j] * l[i];
        }
    }
    // std::cerr << eval(l) << '\n';
    for(int i = 0;i < d;++i) {
        printf("%.10lf%c", vec[i], " \n"[i == d - 1]);
    }

    // for(int i = 0;i < n;++i) {
    //     db sum = 0;
    //     for(int k = 0;k <= d;++k) {
    //         sum += vec[k] * a[i][k];
    //     }
    //     printf("%.10lf\n", sum - a[i][d + 1]);
    // }
    // for(int i = 0;i < n;++i) {
    //     db ans = 0;
    //     for(int k = 0;k < d;++k) {
    //         ans += (vec[k] - x[i][k]) * (vec[k] - x[i][k]);
    //     }
        
    //     printf("%.10lf\n", std::sqrt(ans) - ::r[i]);
    // }
    
}

int main() {
    #ifdef zqj
   // freopen("1.in", "r", stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> d >> n; 
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < d; j++) cin >> x[i][j]; 
        cin >> r[i];
        for(int j = 0; j < d; j++) a[i][j] = - 2 * x[i][j];
        a[i][d] = 1; 
        a[i][d + 1] = r[i] * r[i];
        for(int j = 0; j < d; j++) 
            a[i][d + 1] -= x[i][j] * x[i][j];
    }
    // for(int z = 0; z < n; z++) {
    //     for(int t = 0; t <= d + 1; t++) {
    //         cout << a[z][t] << ' ';
    //     }
    // cout << endl;
    // }
    vector<int> free;
    using pr = std::pair<int, int>;
    vector<pr> other;
    for(int i = 0, r = 0; i <= d; i++) {
        double mx = 0; 
        int k = r; 
        for(int j = r; j < n; j++) {
            if(abs(a[j][i]) > mx) {
                mx = abs(a[j][i]), k = j; 
            }
        }
        if(mx < 1e-5) {
            free.push_back(i);
            continue;
        }
        other.emplace_back(r, i);
        swap(a[r], a[k]);
        for(int j = 0; j < n; j++) if(j != r) {
            double c = a[j][i] / a[r][i];
            for(int k = i; k <= d + 1; k++)
                a[j][k] -= a[r][k] * c; 
        }
        r += 1;
    }
    for(int i : free) {
        base[bc][i] = 1;
        for(auto [pj, j] : other) {
            base[bc][j] = -a[pj][i] / a[pj][j];
        }
        ++bc;

    }
    for(auto [pi, i] : other) {
        X[i] = a[pi][d + 1] / a[pi][i];
    }
    getans();
    return 0; 
}