On one quiet day all of sudden Mister B decided to draw angle _a_ on his field. Aliens have already visited his field and left many different geometric figures on it. One of the figures is **regular convex _n_\-gon** (regular convex polygon with _n_ sides).
That's why Mister B decided to use this polygon. Now Mister B must find three distinct vertices _v_1, _v_2, _v_3 such that the angle (where _v_2 is the vertex of the angle, and _v_1 and _v_3 lie on its sides) is as close as possible to _a_. In other words, the value should be minimum possible.
If there are many optimal solutions, Mister B should be satisfied with any of them.
## Input
First and only line contains two space-separated integers _n_ and _a_ (3 ≤ _n_ ≤ 105, 1 ≤ _a_ ≤ 180) — the number of vertices in the polygon and the needed angle, in degrees.
## Output
Print three space-separated integers: the vertices _v_1, _v_2, _v_3, which form . If there are multiple optimal solutions, print any of them. The vertices are numbered from 1 to _n_ in clockwise order.
[samples]
## Note
In first sample test vertices of regular triangle can create only angle of 60 degrees, that's why every possible angle is correct.
Vertices of square can create 45 or 90 degrees angles only. That's why in second sample test the angle of 45 degrees was chosen, since |45 - 67| < |90 - 67|. Other correct answers are: "3 1 2", "3 2 4", "4 2 3", "4 3 1", "1 3 4", "1 4 2", "2 4 1", "4 1 3", "3 1 4", "3 4 2", "2 4 3", "2 3 1", "1 3 2", "1 2 4", "4 2 1".
In third sample test, on the contrary, the angle of 90 degrees was chosen, since |90 - 68| < |45 - 68|. Other correct answers are: "2 1 4", "3 2 1", "1 2 3", "4 3 2", "2 3 4", "1 4 3", "3 4 1".
某天，Mister B 决定在他的场地上画一个角度为 #cf_span[a] 的角。外星人已经造访过他的场地，并在上面留下了多个不同的几何图形，其中一个是一个 *正凸 #cf_span[n]-边形*（具有 #cf_span[n] 条边的正凸多边形）。
因此，Mister B 决定使用这个多边形。现在，Mister B 需要找到三个不同的顶点 #cf_span[v1]、#cf_span[v2]、#cf_span[v3]，使得角 （其中 #cf_span[v2] 是角的顶点，#cf_span[v1] 和 #cf_span[v3] 位于角的两条边上）尽可能接近 #cf_span[a]。换句话说，要求 的值最小。
如果存在多个最优解，Mister B 可以接受其中任意一个。
输入仅一行，包含两个用空格分隔的整数 #cf_span[n] 和 #cf_span[a]（#cf_span[3 ≤ n ≤ 105]，#cf_span[1 ≤ a ≤ 180]）——分别表示多边形的顶点数和所需的角度（单位为度）。
请输出三个用空格分隔的整数：构成角 的顶点 #cf_span[v1]、#cf_span[v2]、#cf_span[v3]。如果存在多个最优解，请输出任意一个。顶点按顺时针方向从 #cf_span[1] 编号到 #cf_span[n]。
在第一个样例中，正三角形的顶点只能构成 60 度的角，因此任意角度都是正确的。
正方形的顶点只能构成 45 度或 90 度的角。因此，在第二个样例中，选择了 45 度的角，因为 #cf_span[|45 - 67| < |90 - 67|]。其他正确答案包括："3 1 2"、"3 2 4"、"4 2 3"、"4 3 1"、"1 3 4"、"1 4 2"、"2 4 1"、"4 1 3"、"3 1 4"、"3 4 2"、"2 4 3"、"2 3 1"、"1 3 2"、"1 2 4"、"4 2 1"。
在第三个样例中，相反地，选择了 90 度的角，因为 #cf_span[|90 - 68| < |45 - 68|]。其他正确答案包括："2 1 4"、"3 2 1"、"1 2 3"、"4 3 2"、"2 3 4"、"1 4 3"、"3 4 1"。
## Input
第一行仅包含两个用空格分隔的整数 #cf_span[n] 和 #cf_span[a]（#cf_span[3 ≤ n ≤ 105]，#cf_span[1 ≤ a ≤ 180]）——分别表示多边形的顶点数和所需的角度（单位为度）。
## Output
请输出三个用空格分隔的整数：构成角 的顶点 #cf_span[v1]、#cf_span[v2]、#cf_span[v3]。如果存在多个最优解，请输出任意一个。顶点按顺时针方向从 #cf_span[1] 编号到 #cf_span[n]。
[samples]
## Note
在第一个样例中，正三角形的顶点只能构成 60 度的角，因此任意角度都是正确的。正方形的顶点只能构成 45 度或 90 度的角。因此，在第二个样例中，选择了 45 度的角，因为 #cf_span[|45 - 67| < |90 - 67|]。其他正确答案包括："3 1 2"、"3 2 4"、"4 2 3"、"4 3 1"、"1 3 4"、"1 4 2"、"2 4 1"、"4 1 3"、"3 1 4"、"3 4 2"、"2 4 3"、"2 3 1"、"1 3 2"、"1 2 4"、"4 2 1"。在第三个样例中，相反地，选择了 90 度的角，因为 #cf_span[|90 - 68| < |45 - 68|]。其他正确答案包括："2 1 4"、"3 2 1"、"1 2 3"、"4 3 2"、"2 3 4"、"1 4 3"、"3 4 1"。
**Definitions**
Let $ n \in \mathbb{Z} $, $ n \geq 3 $, be the number of vertices of a regular convex $ n $-gon.
Let $ a \in \mathbb{Z} $, $ 1 \leq a \leq 180 $, be the target angle in degrees.
Vertices are labeled $ 1, 2, \dots, n $ in clockwise order.
The central angle between adjacent vertices is $ \theta = \frac{360^\circ}{n} $.
For three distinct vertices $ v_1, v_2, v_3 $, with $ v_2 $ as the apex, the inscribed angle $ \angle v_1 v_2 v_3 $ subtends an arc of $ k \cdot \theta $ degrees, where $ k $ is the number of edges along the shorter arc from $ v_1 $ to $ v_3 $ not containing $ v_2 $, and $ 1 \leq k \leq n-2 $.
The measure of $ \angle v_1 v_2 v_3 $ is:
$$
\alpha_k = \frac{k \cdot \theta}{2} = \frac{k \cdot 180^\circ}{n}
$$
**Constraints**
1. $ 3 \leq n \leq 10^5 $
2. $ 1 \leq a \leq 180 $
3. $ k \in \{1, 2, \dots, n-2\} $
**Objective**
Find $ k \in \{1, 2, \dots, n-2\} $ that minimizes $ \left| \alpha_k - a \right| = \left| \frac{180k}{n} - a \right| $.
Then, output any triple $ (v_1, v_2, v_3) $ such that the arc from $ v_1 $ to $ v_3 $ not containing $ v_2 $ has length $ k $ edges.
For example, fix $ v_2 = 2 $, $ v_1 = 1 $, $ v_3 = 2 + k $ (modulo $ n $, adjusted to 1-based indexing).