Fantasy Pair

In Didiland, the land of fantasy, every resident carries one string as a token of fate. Whether two residents are a fantasy pair is decided in a very plain way. Join their two strings into one, and if that string can be cut exactly into two strings whose lengths are both prime, the two residents are a fantasy pair. Deciding whether such a cut exists is hard for them, so most of them walk past each other without ever knowing.

Write a program that decides whether two residents are a fantasy pair.

Assume that joining the strings and cutting them lose no length at all.

The first line contains the number of test cases $T$ ($1 \le T \le 500$).

Each of the next $T$ lines contains the lengths $A$ and $B$ of the two strings, separated by a space. ($1 \le A, B \le 2 \times 10^{12}$)

Print one line per test case. Print YES if the joined string can be cut exactly into two strings of prime length, and NO otherwise.