Problem: Hag is a very talented person. He has always had an artist inside him but his father forced him to study mechanical engineering.

Yesterday he spent all of his time cutting a giant piece of wood trying to make it look like a goose. Anyway, his dad found out that he was doing arts rather than studying mechanics and other boring subjects. He confronted Hag with the fact that he is a spoiled son that does not care about his future, and if he continues to do arts he will cut his 25 Lira monthly allowance.

Hag is trying to prove to his dad that the wooden piece is a project for mechanics subject. He also told his dad that the wooden piece is a strictly convex polygon with n vertices.

Hag brought two pins and pinned the polygon with them in the 1-st and 2-nd vertices to the wall. His dad has q queries to Hag of two types. 

  * 1 f t: pull a pin from the vertex f, wait for the wooden polygon to rotate under the gravity force (if it will rotate) and stabilize. And then put the pin in vertex t. 
  * 2 v: answer what are the coordinates of the vertex v. 



Please help Hag to answer his father's queries.

You can assume that the wood that forms the polygon has uniform density and the polygon has a positive thickness, same in all points. After every query of the 1-st type Hag's dad tries to move the polygon a bit and watches it stabilize again.

Input

The first line contains two integers n and q (3≤ n ≤ 10 000, 1 ≤ q ≤ 200000) — the number of vertices in the polygon and the number of queries.

The next n lines describe the wooden polygon, the i-th line contains two integers x_i and y_i (|x_i|, |y_i|≤ 10^8) — the coordinates of the i-th vertex of the polygon. It is guaranteed that polygon is strictly convex and the vertices are given in the counter-clockwise order and all vertices are distinct.

The next q lines describe the queries, one per line. Each query starts with its type 1 or 2. Each query of the first type continues with two integers f and t (1 ≤ f, t ≤ n) — the vertex the pin is taken from, and the vertex the pin is put to and the polygon finishes rotating. It is guaranteed that the vertex f contains a pin. Each query of the second type continues with a single integer v (1 ≤ v ≤ n) — the vertex the coordinates of which Hag should tell his father.

It is guaranteed that there is at least one query of the second type.

Output

The output should contain the answer to each query of second type — two numbers in a separate line. Your answer is considered correct, if its absolute or relative error does not exceed 10^{-4}.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if \frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-4}

Examples

Input

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


Output

3.4142135624 -1.4142135624
2.0000000000 0.0000000000
0.5857864376 -1.4142135624


Input

3 2
-1 1
0 0
1 1
1 1 2
2 1


Output

1.0000000000 -1.0000000000

Note

In the first test note the initial and the final state of the wooden polygon. 

<image>

Red Triangle is the initial state and the green one is the triangle after rotation around (2,0).

In the second sample note that the polygon rotates 180 degrees counter-clockwise or clockwise direction (it does not matter), because Hag's father makes sure that the polygon is stable and his son does not trick him.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class _Tp>
_Tp gcd(_Tp a, _Tp b) {
  return (b == 0) ? (a) : (gcd(b, a % b));
}
const long long Inf = 1000000000000000000ll;
const int inf = 1000000000;
char buf[1 << 25], *p1 = buf, *p2 = buf;
inline int getc() {
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 25, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline int read() {
  int x = 0, f = 0;
  char c = getc();
  while (!isdigit(c)) (c == '-') && (f = 1), c = getc();
  while (isdigit(c)) x = x * 10 + (c & 15), c = getc();
  return f ? -x : x;
}
namespace Geometry {
const double eps = 1e-8;
int Cmp(const double x) {
  if (fabs(x) < eps) return 0;
  return x < 0 ? -1 : 1;
}
struct Point {
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  void read() { scanf("%lf%lf", &x, &y); }
  void print() { printf("%.10lf %.10lf", x, y); }
  bool operator<(Point rhs) const {
    return (x != rhs.x) ? (x < rhs.x) : (y < rhs.y);
  }
  double length() { return sqrt(x * x + y * y); }
  Point rotate(double rad) {
    return Point(x * cos(rad) - y * sin(rad), x * sin(rad) + y * cos(rad));
  }
};
double sqr(double x) { return x * x; }
Point operator+(Point a, Point b) { return Point(a.x + b.x, a.y + b.y); }
Point operator-(Point a, Point b) { return Point(a.x - b.x, a.y - b.y); }
Point operator*(Point a, double b) { return Point(a.x * b, a.y * b); }
Point operator/(Point a, double b) { return Point(a.x / b, a.y / b); }
bool operator==(Point a, Point b) {
  return (fabs(a.x - b.x) < eps && fabs(a.y - b.y) < eps);
}
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
double length(Point a) { return sqrt(dot(a, a)); }
double angle(Point a, Point b) {
  return acos(dot(a, b) / (length(a) * length(b)));
}
bool onsegment(Point p, Point a1, Point a2) {
  return (Cmp(cross(a1 - p, a2 - p) == 0) && Cmp(dot(a1 - p, a2 - p)) < 0);
}
double dis(Point a, Point b) { return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y)); }
Point normal(Point a) {
  double l = length(a);
  return Point(-a.y / l, a.x / l);
}
double rad(Point a, Point b) { return atan2(cross(a, b), dot(a, b)); }
}  // namespace Geometry
using namespace Geometry;
Point Centroid(Point* st, Point* ed) {
  int n = ed - st;
  Point res = Point(0, 0);
  double S = 0;
  for (int i = 1; i < n - 1; ++i) {
    double s = fabs(cross(st[i] - st[0], st[i + 1] - st[0]));
    res = res + (st[0] + st[i] + st[i + 1]) * s / 3;
    S += s;
  }
  return res / S;
}
const int N = 10005;
int n, q;
Point p[N], o;
double ang;
int main() {
  n = read();
  q = read();
  for (int i = 1; i <= n; ++i) {
    p[i].x = read();
    p[i].y = read();
  }
  o = Centroid(p + 1, p + n + 1);
  for (int i = 1; i <= n; ++i) p[i] = p[i] - o;
  int p1 = 1, p2 = 2;
  while (q--) {
    int op = read();
    if (op == 1) {
      int f = read(), t = read();
      int oth = (f == p1) ? p2 : p1;
      Point tmp = o + p[oth].rotate(ang);
      double cur = rad(o - tmp, Point(0, -1));
      o = tmp + Point(0, -1) * p[oth].length();
      ang += cur;
      if (f == p1)
        p1 = t;
      else
        p2 = t;
    } else {
      int f = read();
      Point t = o + p[f].rotate(ang);
      t.print();
      puts("");
    }
  }
  return 0;
}