Snowball Duel

Max and Lily are engaged in a friendly snowball fight on a rectangular grid. They stand at two positions such that they can directly hit each other if and only if they are in the same row or the same column. Formally, given a grid of size \(n \times m\) with \(1 \leq n, m \leq 10^9\), they can hit each other directly if either \(n = 1\) or \(m = 1\). Otherwise, there is at least one row and one column between them, blocking a direct line of fire.

Your task is to determine whether they can throw snowballs directly at each other. Output "Yes" if they can, and "No" otherwise.

inputFormat

The input consists of a single line containing two space-separated integers \(n\) and \(m\), representing the number of rows and columns of the grid respectively.

outputFormat

Output a single line containing either "Yes" if Max and Lily can hit each other directly, or "No" otherwise.

3 3

No