跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2617. Sequence of points

  • ID: 2623
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 计算几何
  • 模拟
  • 数学
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Sequence of points

题目描述

C. Sequence of points
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given the following points with integer coordinates on the plane: M0,A0,A1,...,An-1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi-1 according (for every natural number i). Here point B is symmetric to A according M, if M is the center of the line segment AB. Given index j find the point Mj.

Input

On the first line you will be given an integer n (1≤n≤105), which will be odd, and j (1≤j≤1018), where j is the index of the desired point. The next line contains two space separated integers, the coordinates of M0. After that n lines follow, where the i-th line contain the space separated integer coordinates of the point Ai-1. The absolute values of all input coordinates will not be greater then 1000.

Output

On a single line output the coordinates of Mj, space separated.

Examples
Input
3 4
0 0
1 1
2 3
-5 3
Output
14 0
Input
3 1
5 5
1000 1000
-1000 1000
3 100
Output
1995 1995

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2272 题。保留原作者与原赛事署名。