In Storia Kingdom, there is an artifact called "Perfect Sphere" made by a great meister Es. This is handed down for generations in the royal palace as a treasure. Es left a memo and filled mysterious values in it. Within achievements of researches, it has been revealed that the values denote coordinate values. However it is still unknown the definition of the coordinate system.

By the way, you are a person who lived in age of Es lived. The values which meister Es left are defined by following. Es set an moving object in the artifact sphere. Surprisingly, that is rigid body and perpetual organization. The object rotates inside the sphere and it is always touching the inside surface of the sphere. This value is a coordinate of the tangent point by the object and the sphere, but it is not a three dimensional value. The object is a plate and this is a simple polygon. Here, "simple" means "non self-intersected". This rotates while touching a great circle of the sphere. Here, assume that the great circle is a circle O centered in the origin in the xy plane. (It is two-dimensional Cartesian coordinate system, the direction of positive x-value is right and the direction of positive y-value is up). This plate touches the circle O with a single point at the beginning of the movement. And it rotates in counterclockwise as the current touching point is the rotation fulcrum. When another point X of the plate touches the circle O newly, the plate continue to rotate as described above, but in the next rotation, the rotation fulcrum point is changed. This will be the point X. If two or more points can be interpreted as the point X, the point X is a most distant point from the currently touching point X'. Here, that distance is the length of the arc of the circle O from the point X' to the point X in clockwise.

Es asked you, an excellent assistant, to write a program that enumerates Q tangent points (fulcrum points while the movement) by the plate and the circle O while the movement of the plate described above in the chronological order. Of course, one and the previous one must be distinct points. Following figures show you examples of the movement of the plate inside the circle O.
1
<image>
2
<image>
3
<image>
4
<image>

Constraints

The number of datasets is less than or equal to 400.
3≤N≤25
1≤R≤1000
0≤Q≤100

Input

Input consists of multiple datasets.
A dataset is given in a following format.


N R Q
x1 y1
x2 y2
...
xN yN


N, R, Q are integers that represent the number of points of the plate, the radius of the circle, and the number of points Es needs respectively.
Following N lines contain 2N integers that represent coordinates of the plate's points ( xk , yk ) in the circle.(1≤k≤N)


You can assume following conditions.
* Points of the plate are given in counterclockwise.
* No three points are co-linear.
* N-1 points of the plate are given inside of the circle (distances between the center of the circle and these points are less than R). And 1 point is on the circle edge.
N=R=Q=0 shows the end of input.

Output

For each dataset, output (Px Py:real number) in Q in the following format.


Px1 Px1
Px2 Py2
...
PxN+1 PyN+1


These answers must satisfy |Txi-Pxi|≤0.0001 and |Tyi-Pyi|≤0.0001.
Here, Pxi, Pyi(1≤i≤Q) are your output and Txi,Tyi(1≤i≤Q) are judge's output.

Example

Input

4 10 8
0 -10
3 -7
0 -4
-3 -7
0 0 0


Output

-4.146082488326 -9.100000000000
-7.545870128753 -6.562000000000
-9.587401146004 -2.842840000000
-9.903199956975 1.388031200000
-8.436422775690 5.369056784000
-5.451089494781 8.383652146880
-1.484560104812 9.889190123322
2.749190104024 9.614673877565
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const double EPS = 1.0e-4;

class Point
{
public:
    double y, x;
    Point(){
        y = x = 0.0;
    }
    Point(double y0, double x0){
        y = y0;
        x = x0;
    }
    Point(double theta){
        y = sin(theta);
        x = cos(theta);
    }
    Point operator+(const Point& p) const{
        return Point(y + p.y, x + p.x);
    }
    Point operator-(const Point& p) const{
        return Point(y - p.y, x - p.x);
    }
    Point operator*(double a) const{
        return Point(y * a, x * a);
    }
    Point operator/(double a) const{
        return Point(y / a, x / a);
    }
    double length() const{
        return sqrt(y * y + x * x);
    }
    double dist(const Point& p) const{
        return sqrt(pow(y - p.y, 2) + pow(x - p.x, 2));
    }
    double dot(const Point& p) const{
        return y * p.y + x * p.x; // |a|*|b|*cos慮
    }
    double cross(const Point& p) const{
        return x * p.y - y * p.x; // |a|*|b|*sin慮
    }
    double angle() const{
        return atan2(y, x);
    }
    Point rotate(double theta) const{
        return Point(x*sin(theta) + y*cos(theta), x*cos(theta) - y*sin(theta));
    }
};

int circlesIntersection(const Point& p1, double r1, const Point& p2, double r2, vector<Point>& intersection)
{
    double y = p2.y - p1.y;
    double x = p2.x - p1.x;
    double a = (y*y + x*x + r1*r1 - r2*r2) / 2;
    double b = (y*y + x*x) * r1*r1 - a*a;

    if(y*y + x*x < EPS || b < -EPS){
        intersection.resize(0);
        return 0;
    }
    if(b < EPS){
        intersection.assign(1, Point(y, x) * (a / (y*y + x*x)) + p1);
        return 1;
    }

    intersection.assign(2, Point(x, -y) * sqrt(b));
    intersection[1] = intersection[1] * -1;
    for(int i=0; i<2; ++i)
        intersection[i] = (intersection[i] + Point(y, x) * a) / (y*y + x*x) + p1;
    return 2;
}

int main()
{
    for(;;){
        int n, q;
        double r;
        cin >> n >> r >> q;
        if(n == 0)
            return 0;

        vector<Point> p(n);
        int curr;
        for(int i=0; i<n; ++i){
            cin >> p[i].x >> p[i].y;
            if(abs(p[i].length() - r) < EPS)
                curr = i;
        }

        while(--q >= 0){
            int next;
            double minAngle = DBL_MAX;

            for(int i=(curr+1)%n; i!=curr; i=(i+1)%n){
                double len = (p[i] - p[curr]).length();
                vector<Point> q;
                circlesIntersection(Point(0, 0), r, p[curr], len, q);

                for(int j=0; j<2; ++j){
                    if((p[i] - p[curr]).cross(q[j] - p[curr]) < EPS)
                        continue;

                    double angle = (p[i] - p[curr]).dot(q[j] - p[curr]);
                    angle /= pow(len, 2);
                    angle = acos(angle);

                    if(angle < minAngle - EPS){
                        next = i;
                        minAngle = angle;
                    }
                }
            }

            for(int i=(curr+1)%n; i!=curr; i=(i+1)%n){
                p[i] = p[i] - p[curr];
                p[i] = p[i].rotate(minAngle);
                p[i] = p[i] + p[curr];
            }

            curr = next;
            printf("%.10f %.10f\n", p[curr].x, p[curr].y);
        }
    }
}