Alice and Bob have the following RSA parameters:

$n_A=171024704183616109700818066925197841516671277$

$n_B=839073542734369359260871355939062622747633109$

$e_A=1571,e_B=87697$

Bob knows that

$p_B=98763457697834568934613,q_B=8495789457893457345793$

$($where $n_B=p_B{q}_B).$ Alice signs a document and sends the document and signature $(m,s)($where $($:$s-=m^{d_A}(mod{n}_A)$