Program Multiple;//By_Thispoet
Constmaxn=20000;
Varh,t,j,k,m,n,i            :Longint;seq,fa,mol             :Array[1..maxn]of Integer;a                     :Array[1..maxn]of Longint;fg                        :Array[0..maxn]of Boolean;flag                  :Boolean;ans                        :Array[1..maxn*2]of Longint;Procedure Qsort(l,r:Longint);
var i,j,k,temp:Longint;
begini:=l;j:=r;k:=a[(i+j)>>1];repeatwhile a[i]<k do inc(i);while a[j]>k do dec(j);if i<=j thenbegintemp:=a[i];a[i]:=a[j];a[j]:=temp;inc(i);dec(j);end;until i>j;if i<r then Qsort(i,r);if l<j then QSort(l,j);
end;Procedure Deal(i:Longint);
begink:=0;while i<>0 dobegininc(k);ans[k]:=seq[i];i:=fa[i];end;for i:=k downto 1 do write(ans[i]);writeln;
end;BEGINreadln(n);readln(m);while not eof dobeginfillchar(fg,sizeof(fg),0);fillchar(fa,sizeof(fa),0);for i:=1 to m do readln(a[i]);flag:=true;Qsort(1,m);h:=0;if n=0 thenbeginwriteln(0);readln(n);readln(m);continue;end;if a[1]=0 thenbeginfor i:=2 to m dobeginseq[i-1]:=a[i];fg[a[i] mod n]:=true;mol[i-1]:=a[i] mod n;if a[i] mod n=0 thenbeginflag:=false;writeln(a[i]);end;if not flag then break;end;t:=m-1;end elsebeginfor i:=1 to m dobeginseq[i]:=a[i];fg[a[i] mod n]:=true;mol[i]:=a[i] mod n;if a[i] mod n=0 thenbeginwriteln(a[i]);flag:=false;end;if not flag then break;end;t:=m;end;if not flag thenbeginreadln(n);readln(m);continue;end;while h<t dobegininc(h);for j:=1 to m dobegini:=(mol[h]*10+a[j])mod n;if fg[i] then continue elsebeginfg[i]:=true;inc(t);seq[t]:=a[j];fa[t]:=h;mol[t]:=i;end;if i=0 thenbeginDeal(t);flag:=false;end;end;end;if flag then writeln(0);readln;readln(n);readln(m);end;
END.