Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E1. Guard Duty (easy)

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe Rebel fleet is afraid that the Empire might want to strike back again. Princess Heidi needs to know if it is possible to assign *R* Rebel spaceships to guard *B* bases so that every base has exactly one guardian and each spaceship has exactly one assigned base (in other words, the assignment is a perfect matching). Since she knows how reckless her pilots are, she wants to be sure that any two (straight) paths – from a base to its assigned spaceship – do not intersect in the galaxy plane (that is, in 2D), and so there is no risk of collision.

Input

The first line contains two space-separated integers *R*, *B*(1 ≤ *R*, *B* ≤ 10). For 1 ≤ *i* ≤ *R*, the *i* + 1-th line contains two space-separated integers *x*_{i} and *y*_{i} (|*x*_{i}|, |*y*_{i}| ≤ 10000) denoting the coordinates of the *i*-th Rebel spaceship. The following *B* lines have the same format, denoting the position of bases. It is guaranteed that no two points coincide and that no three points are on the same line.

Output

If it is possible to connect Rebel spaceships and bases so as satisfy the constraint, output Yes, otherwise output No (without quote).

Examples

Input

3 3

0 0

2 0

3 1

-2 1

0 3

2 2

Output

Yes

Input

2 1

1 0

2 2

3 1

Output

No

Note

For the first example, one possible way is to connect the Rebels and bases in order.

For the second example, there is no perfect matching between Rebels and bases.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/22/2019 04:14:51 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|