I do not see clearly how to use the information that the coefficients be integer numbers, apart the fact that $1\le |b_m|\le |a_n|$; therefore the following estimate is possibly non-optimal. However, it gives a simple and explicit bound, that also holds for complex coefficients.

By a [classic estimate on  the zeros of a polynomial][1], all (complex) roots of $f$ are bounded in modulus by $$1+\max_{0\le i < n}\frac{|a_i|}{|a_n|}\le M+1\, ,$$ 
because $|a_m|\ge1$. Since $b_i$ is the $i$-th elementary symmetric polynomial of some $m$ of the roots of $f$, times $b_m$, which is less that $M$ is size, we have

$$|b_i|\le M {m \choose i}(M+1)^i\, ,$$
so for instance
$$\sum_{i=0}^m|b_i|\le M':=M(M+2)^m\, .$$



[1]:http://en.wikipedia.org/wiki/Fundamental_theorem_of_algebra#Bounds_on_the_zeroes_of_a_polynomial