fbncsieve v1.7.1, a program to find factors of k*b^n+c numbers for fixed b, n, and c and variable k
-h --help             prints this help
-p --pmin=P0          sieve start: P0 < p (default 1)
-P --pmax=P1          sieve end: p < P1 (default 2^62)
-w --worksize=w       initial primes per chunk of work (default 16000)
-W --workers=W        start W workers (default 0)
-A --applyandexit     apply factors and exit (used with -I)
-i --inputterms=i     input file of remaining candidates
-I --inputfactors=I   input file with factors (used with -A)
-o --outputterms=o    output file of remaining candidates
-O --outputfactors=O  output file with new factors
-4 --fpstarget=4      stop sieving ASAP when factors per second falls below this value
-5 --spftarget=5      stop sieving ASAP when seconds per factor goes above this value
-6 --minutesforspf=6  maximum number of minutes to use for computed seconds per factor
-k --kmin=k           Minimum k to search
-K --kmax=K           Maximum k to search
-s --sequence=s       Sequence to find factors of in form k*b^n+c where b, n, and c are integer values
-f --format=f         Format of output file (A=ABC, D=ABCD (default), N=NEWPGEN)
-r --remove           Remove k where k % base = 0
