#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>

#define sqr(x) (x*x)

#define maxn 555

template<class T>

inline T read() {
    T r = 0, f = 0;
    char c;

    while (!isdigit(c = getchar()))
        f |= (c == '-');

    while (isdigit(c))
        r = (r << 1) + (r << 3) + (c & 15), c = getchar();

    return f ? -r : r;
}

template<class T>

inline T abs(T a) {
    return a < 0 ? -a : a;
}

constexpr double eps = 1e-9;

#define vec std::vector<double>

template<class T1, class T2>

inline void Gauss(int n, int m, T1 &a, T2 &b) {
    for (int i = 1; i <= n; i++) {
        if (abs(a[i][i] - 1) > eps) {
            for (int j = i + 1; j <= m; j++)
                a[i][j] /= a[i][i];

            b[i] /= a[i][i], a[i][i] = 1.0000000;
        }

        for (int j = 1; j <= n; j++) {
            if (i == j)
                continue;

            double d = a[j][i];

            for (int k = i; k <= m; k++)
                a[j][k] -= a[i][k] * d;

            b[j] -= b[i] * d;
        }
    }
}

int D, n, r;

double R, v[maxn], b[maxn], c[maxn];

double A[maxn][maxn], B[maxn][maxn];

inline void out() {
    for (int i = 1; i <= D; i++)
        printf("%.6lf ", v[i] - b[i]);
}

int main() {
    D = read<int>(), n = read<int>() - 1;

    for (int i = 1; i <= D; i++)
        scanf("%lf", &v[i]);

    scanf("%lf", &R);

    if (!n) {
        b[1] = R;
        return out(), 0;
    }

    int lim = n > D ? D : n;

    for (int i = 1; i <= lim; i++) {
        for (int j = 1; j <= D; j++) {
            scanf("%lf", &A[i][j]);
            A[i][j] -= v[j], b[i] -= sqr(A[i][j]);
        }

        double Rr;
        scanf("%lf", &Rr);
        (b[i] += sqr(Rr) - sqr(R)) /= 2;
    }

    if (n >= D) {
        Gauss(D, D, A, b);
        return out(), 0;
    }

    Gauss(n, D, A, b), r = D - n;

    for (int i = n + 1; i <= D; i++)
        A[i][i] = -1;

    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= r; j++) {
            int lim = (i > j ? i : j) + n;

            for (int k = 1; k <= lim; k++)
                B[i][j] += A[k][i + n] * A[k][j + n];
        }

        for (int k = 1; k <= i + n; k++)
            c[i] -= A[k][i + n] * b[k];
    }

    Gauss(r, r, B, c);

    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= D; j++)
            b[j] += c[i] * A[j][i + n];

    double dis = R * R, Dis = 0;

    for (int i = 1; i <= D; i++) {
        dis -= b[i] * b[i];
        Dis += A[i][n + 1] * A[i][n + 1];
    }

    dis = sqrt(dis / Dis);

    for (int i = 1; i <= n + 1; i++)
        b[i] += A[i][n + 1] * dis;

    out();
    return 0;
}