About discrete logrithm

As we know, the discrete logrithm problem (DLP) is a hard problem. But
with the development of math, DLP's difficulty denpends on the
bit-length of p and q, where p is the modular, and q is the generator
g's order. Can you give me the concrete number of them? Thanks in
advance!

.