'''
Verifier for answers for the PPCG question Finding Collatz-like rules with many loops
 
Input is expected from standard input as space-separated integers `d m i min_value_1 min_value_2 ...`.
E.g. for d=3 m=7 i=8 min_values=[1 2 4] the input should be "3 7 8 1 4 2"
'''
 
def itOne(n,d,m,i):    
    return (n*m+i) if n%d else n//d
 
def checkMin(n,d,m,i):
    ni=n
    while True:
        ni=itOne(ni,d,m,i)
        if ni<n:
            return False
        if ni==n:
            return True
 
strin=input()
d,m,i,*mins=map(int,strin.split())
 
ok=True
minset=set()
 
for mine in mins:    
    if mine in minset or not checkMin(mine,d,m,i):
        ok=False
        break
    minset.add(mine)
 
if ok:
    print('d=',d,' m=',m,' i=',i,' is VERIFIED for a score of ',len(minset),'.',sep='')
else:
    print('The given input FAILED the test.')
 

JycnClZlcmlmaWVyIGZvciBhbnN3ZXJzIGZvciB0aGUgUFBDRyBxdWVzdGlvbiBGaW5kaW5nIENvbGxhdHotbGlrZSBydWxlcyB3aXRoIG1hbnkgbG9vcHMKCklucHV0IGlzIGV4cGVjdGVkIGZyb20gc3RhbmRhcmQgaW5wdXQgYXMgc3BhY2Utc2VwYXJhdGVkIGludGVnZXJzIGBkIG0gaSBtaW5fdmFsdWVfMSBtaW5fdmFsdWVfMiAuLi5gLgpFLmcuIGZvciBkPTMgbT03IGk9OCBtaW5fdmFsdWVzPVsxIDIgNF0gdGhlIGlucHV0IHNob3VsZCBiZSAiMyA3IDggMSA0IDIiCicnJwoKZGVmIGl0T25lKG4sZCxtLGkpOiAgICAKICAgIHJldHVybiAobiptK2kpIGlmIG4lZCBlbHNlIG4vL2QKCmRlZiBjaGVja01pbihuLGQsbSxpKToKICAgIG5pPW4KICAgIHdoaWxlIFRydWU6CiAgICAgICAgbmk9aXRPbmUobmksZCxtLGkpCiAgICAgICAgaWYgbmk8bjoKICAgICAgICAgICAgcmV0dXJuIEZhbHNlCiAgICAgICAgaWYgbmk9PW46CiAgICAgICAgICAgIHJldHVybiBUcnVlCgpzdHJpbj1pbnB1dCgpCmQsbSxpLCptaW5zPW1hcChpbnQsc3RyaW4uc3BsaXQoKSkKCm9rPVRydWUKbWluc2V0PXNldCgpCgpmb3IgbWluZSBpbiBtaW5zOiAgICAKICAgIGlmIG1pbmUgaW4gbWluc2V0IG9yIG5vdCBjaGVja01pbihtaW5lLGQsbSxpKToKICAgICAgICBvaz1GYWxzZQogICAgICAgIGJyZWFrCiAgICBtaW5zZXQuYWRkKG1pbmUpCgppZiBvazoKICAgIHByaW50KCdkPScsZCwnIG09JyxtLCcgaT0nLGksJyBpcyBWRVJJRklFRCBmb3IgYSBzY29yZSBvZiAnLGxlbihtaW5zZXQpLCcuJyxzZXA9JycpCmVsc2U6CiAgICBwcmludCgnVGhlIGdpdmVuIGlucHV0IEZBSUxFRCB0aGUgdGVzdC4nKQo=

MyA3IDggMSA0IDI=

3 7 8 1 4 2