program enigmath; (*Essendo E=N+S(N)+S(S(N))...il problema chiede di trovare N=E-[S(N)+S(S(N))...]*)
                  (*Si noti che la somma massima delle cifre per un numero inferiore a 10^9 è 9x9=81.*)
            (*La "somma delle somme" massima è però 79 + 16 + 7 = 102 ottenuta da numeri tipo 799999999, e le decodificazioni di E sono superiori a E-102.*)
Uses Math;
const MAXX=102;
var
    Emin, Emax, i, S, K, inizio, val, count : longint;
    cod, dec :array[0..1000000]  of longint; (*in cod[i] metto la codifica del numero e in dec[i], inizializzato a zero, sommo +1 tutte le volte che trovo*)                                                  (*un numero N di cui è la codifica*)
 
function codifica (x:Longint):Longint;
 begin
    if x < 10 then codifica:=x (* single digit*)
              else 
                begin
		   S := 0; K:= x;
		   while K>0 do 
            		 begin 
            		   S:=S + K mod 10; (*sum of digits*)
            		   K:=K div 10;
           		 end;  
    		   codifica:=x + codifica(S);
                end;
end;
 
begin
    (*assign(input,  'input.txt');  reset(input);
    assign(output, 'output.txt'); rewrite(output);
*)
    readln(Emin,Emax);
    if Emin<=102 then inizio:=0    (*Quindi, se Emin>=102 parto da Emin-102 , altrimenti parto da zero e salvo la loro codifica*)
                 else inizio:=Emin-102;
    count:=Emax-Emin+1; (*numero di termini da considerare*)
    for i:=inizio to count do dec[i]:=0;             
    for i := inizio to Emax do
              begin
                 val := codifica(i); Writeln(val,' ',' i ',i);
                 if (Emin <= val) and (val <= Emax) then 
                                       begin
                                        cod[val-Emin]:=i;
                                        dec[val-Emin]:=dec[val-Emin]+1;
                                        writeln(cod[val-Emin],' ',dec[val-Emin]);
                                       end;
              end;
    for i := 0 to count-1 do
                begin
                  if dec[i]= 0 then writeln('IMPOSSIBLE')      (*no decodings exist for E*)
                     else if dec[i]>1 then writeln('AMBIGUOUS')  (*multiple possible decodings exist for E*)
                          else writeln(cod[i]);                    (*unique decoding of E*)
                end;
 end.

cHJvZ3JhbSBlbmlnbWF0aDsgKCpFc3NlbmRvIEU9TitTKE4pK1MoUyhOKSkuLi5pbCBwcm9ibGVtYSBjaGllZGUgZGkgdHJvdmFyZSBOPUUtW1MoTikrUyhTKE4pKS4uLl0qKQogICAgICAgICAgICAgICAgICAoKlNpIG5vdGkgY2hlIGxhIHNvbW1hIG1hc3NpbWEgZGVsbGUgY2lmcmUgcGVyIHVuIG51bWVybyBpbmZlcmlvcmUgYSAxMF45IMOoIDl4OT04MS4qKQogICAgICAgICAgICAoKkxhICJzb21tYSBkZWxsZSBzb21tZSIgbWFzc2ltYSDDqCBwZXLDsiA3OSArIDE2ICsgNyA9IDEwMiBvdHRlbnV0YSBkYSBudW1lcmkgdGlwbyA3OTk5OTk5OTksIGUgbGUgZGVjb2RpZmljYXppb25pIGRpIEUgc29ubyBzdXBlcmlvcmkgYSBFLTEwMi4qKQpVc2VzIE1hdGg7CmNvbnN0IE1BWFg9MTAyOwp2YXIKICAgIEVtaW4sIEVtYXgsIGksIFMsIEssIGluaXppbywgdmFsLCBjb3VudCA6IGxvbmdpbnQ7CiAgICBjb2QsIGRlYyA6YXJyYXlbMC4uMTAwMDAwMF0gIG9mIGxvbmdpbnQ7ICgqaW4gY29kW2ldIG1ldHRvIGxhIGNvZGlmaWNhIGRlbCBudW1lcm8gZSBpbiBkZWNbaV0sIGluaXppYWxpenphdG8gYSB6ZXJvLCBzb21tbyArMSB0dXR0ZSBsZSB2b2x0ZSBjaGUgdHJvdm8qKSAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgKCp1biBudW1lcm8gTiBkaSBjdWkgw6ggbGEgY29kaWZpY2EqKQogICAgCmZ1bmN0aW9uIGNvZGlmaWNhICh4OkxvbmdpbnQpOkxvbmdpbnQ7CiBiZWdpbgogICAgaWYgeCA8IDEwIHRoZW4gY29kaWZpY2E6PXggKCogc2luZ2xlIGRpZ2l0KikKICAgICAgICAgICAgICBlbHNlIAogICAgICAgICAgICAgICAgYmVnaW4KCQkgICBTIDo9IDA7IEs6PSB4OwoJCSAgIHdoaWxlIEs+MCBkbyAKICAgICAgICAgICAgCQkgYmVnaW4gCiAgICAgICAgICAgIAkJICAgUzo9UyArIEsgbW9kIDEwOyAoKnN1bSBvZiBkaWdpdHMqKQogICAgICAgICAgICAJCSAgIEs6PUsgZGl2IDEwOwogICAgICAgICAgIAkJIGVuZDsgIAogICAgCQkgICBjb2RpZmljYTo9eCArIGNvZGlmaWNhKFMpOwogICAgICAgICAgICAgICAgZW5kOwplbmQ7CgpiZWdpbgogICAgKCphc3NpZ24oaW5wdXQsICAnaW5wdXQudHh0Jyk7ICByZXNldChpbnB1dCk7CiAgICBhc3NpZ24ob3V0cHV0LCAnb3V0cHV0LnR4dCcpOyByZXdyaXRlKG91dHB1dCk7CiopCiAgICByZWFkbG4oRW1pbixFbWF4KTsKICAgIGlmIEVtaW48PTEwMiB0aGVuIGluaXppbzo9MCAgICAoKlF1aW5kaSwgc2UgRW1pbj49MTAyIHBhcnRvIGRhIEVtaW4tMTAyICwgYWx0cmltZW50aSBwYXJ0byBkYSB6ZXJvIGUgc2Fsdm8gbGEgbG9ybyBjb2RpZmljYSopCiAgICAgICAgICAgICAgICAgZWxzZSBpbml6aW86PUVtaW4tMTAyOwogICAgY291bnQ6PUVtYXgtRW1pbisxOyAoKm51bWVybyBkaSB0ZXJtaW5pIGRhIGNvbnNpZGVyYXJlKikKICAgIGZvciBpOj1pbml6aW8gdG8gY291bnQgZG8gZGVjW2ldOj0wOyAgICAgICAgICAgICAKICAgIGZvciBpIDo9IGluaXppbyB0byBFbWF4IGRvCiAgICAgICAgICAgICAgYmVnaW4KICAgICAgICAgICAgICAgICB2YWwgOj0gY29kaWZpY2EoaSk7IFdyaXRlbG4odmFsLCcgJywnIGkgJyxpKTsKICAgICAgICAgICAgICAgICBpZiAoRW1pbiA8PSB2YWwpIGFuZCAodmFsIDw9IEVtYXgpIHRoZW4gCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIGJlZ2luCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICBjb2RbdmFsLUVtaW5dOj1pOwogICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgZGVjW3ZhbC1FbWluXTo9ZGVjW3ZhbC1FbWluXSsxOwogICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgd3JpdGVsbihjb2RbdmFsLUVtaW5dLCcgJyxkZWNbdmFsLUVtaW5dKTsKICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgZW5kOwogICAgICAgICAgICAgIGVuZDsKICAgIGZvciBpIDo9IDAgdG8gY291bnQtMSBkbwogICAgICAgICAgICAgICAgYmVnaW4KICAgICAgICAgICAgICAgICAgaWYgZGVjW2ldPSAwIHRoZW4gd3JpdGVsbignSU1QT1NTSUJMRScpICAgICAgKCpubyBkZWNvZGluZ3MgZXhpc3QgZm9yIEUqKQogICAgICAgICAgICAgICAgICAgICBlbHNlIGlmIGRlY1tpXT4xIHRoZW4gd3JpdGVsbignQU1CSUdVT1VTJykgICgqbXVsdGlwbGUgcG9zc2libGUgZGVjb2RpbmdzIGV4aXN0IGZvciBFKikKICAgICAgICAgICAgICAgICAgICAgICAgICBlbHNlIHdyaXRlbG4oY29kW2ldKTsgICAgICAgICAgICAgICAgICAgICgqdW5pcXVlIGRlY29kaW5nIG9mIEUqKQogICAgICAgICAgICAgICAgZW5kOwogZW5kLg==

MTA1IDExMA==

105 110