C++ LANGUAGE

1. Needle in the Haystack

   by CodeChum Admin

   Let's now try finding a certain digit into an integer! Come and join in on the fun and code with me!

   Instructions:

2. Input two integers in one single line. The first inputted integer must be within 0-9 only.
3. Using loops, identify if the first inputted integer (0-9) is present in the second inputted integer. If it is found, print "Yes"; otherwise, print "No". Tip: If the number is already found even without reaching the end of the loop, use the break keyword to exit the loop early for a more efficient code.

Input

1231214238

Output

Yes