For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.

Constraints

* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \leq 10,000$
* $1 \leq r \leq 10,000$

Input

The input is given in the following format.

$cx\; cy\; r$
$q$
$Line_1$
$Line_2$
:
$Line_q$


In the first line, the center coordinate of the circle and its radius are given by $cx$, $cy$ and $r$. In the second line, the number of queries $q$ is given.

In the following $q$ lines, as queries, $Line_i$ are given ($1 \leq i \leq q$) in the following format.

$x_1\; y_1\; x_2\; y_2$

Each line is represented by two points $p1$ and $p2$ which the line crosses. The coordinate of $p1$ and $p2$ are given by ($x1$, $y1$) and ($x2$, $y2$) respectively. All input values are given in integers.

Output

For each query, print the coordinates of the cross points in the following rules.

* If there is one cross point, print two coordinates with the same values.
* Print the coordinate with smaller $x$ first. In case of a tie, print the coordinate with smaller $y$ first.



The output values should be in a decimal fraction with an error less than 0.000001.

Example

Input

2 1 1
2
0 1 4 1
3 0 3 3


Output

1.00000000 1.00000000 3.00000000 1.00000000
3.00000000 1.00000000 3.00000000 1.00000000
#include<stdio.h>
#include<math.h>

using namespace std;

double dDISTANCE(const double &x, const double &y, const double &x1, const double &y1, const double &x2, const double &y2){    //点(x, y)と直線の距離
    double a, b, c;    //直線をax+by+c=0 の形式で書く  
    a = y2 - y1;
    b = x2 - x1;
    c = x2 * y1 - x1 * y2;
    return fabs(a * x - b * y + c) / sqrt(a * a + b * b);
}

int iSgn(const double &x, const double &y, const double &x1, const double &y1, const double &x2, const double &y2){    //点(x,y)が直線の正領域か負領域か判定
    if ( (y2 - y1) * x - (x2 - x1) * y + x2 * y1 - x1 * y2 >= 0 ){
        return 1;
    } else {
        return -1;
    }
}

double dNORM(const double &x, const double &y){
    return sqrt(x * x + y * y);
}

void swap(double &a, double &b){
    double iTmp = a;
    a = b; 
    b = iTmp;
}

int main(){
    const double dTolerance = 1.0e-10;
    double cx,cy,r;
    scanf("%lf %lf %lf", &cx, &cy, &r);
    int q;
    scanf("%d", &q);
    
    for (int i = 0; i < q; i++){
        double x1,x2,y1,y2;
        scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
        double dLineDist = dDISTANCE(cx, cy, x1, y1, x2, y2);    //点と直線の距離
        double dDist = dNORM(x2 - x1, y2 - y1);    //点と点の距離
        double px,py;    //射影
        px = cx - (double)iSgn(cx, cy, x1, y1, x2, y2) * (y2 - y1) * dLineDist / dDist;
        py = cy - (double)iSgn(cx, cy, x1, y1, x2, y2) * (x1 - x2) * dLineDist / dDist;

        if (fabs(r - dLineDist) < dTolerance){
            printf("%lf %lf %lf %lf\n", px, py, px, py);
        } else {
            if (x1 - x2 >= dTolerance){
                swap(x1,x2);
                swap(y1,y2);
            } 
            if (fabs(x1 - x2) < dTolerance && y1 - y2 >= dTolerance){
                swap(x1,x2);
                swap(y1,y2);
            }
            double ax1 = px - (x2 - x1) * sqrt(r * r - dLineDist * dLineDist) / dDist;
            double ay1 = py - (y2 - y1) * sqrt(r * r - dLineDist * dLineDist) / dDist;
            double ax2 = px + (x2 - x1) * sqrt(r * r - dLineDist * dLineDist) / dDist;
            double ay2 = py + (y2 - y1) * sqrt(r * r - dLineDist * dLineDist) / dDist;
            printf("%lf %lf %lf %lf\n", ax1, ay1, ax2, ay2);
        }
    }
    return 0;
}
