What is the unique three-digit positive integer x satisfying 100x = 1 (mod 991).
a=100; c=100*a % 991; if(c==1, goto3, goto4);printc, a; a++;if(a<1000, goto1, 0)
x = 882
[100*882] mod 991 ==1
