Computation of Stirling Numbers

Hi, this is quite a specific question.

I am wondering if people know of any ways of computing stirling numbers
of the first kind efficiently?  The only way I know of is to
recursively compute

s(n+1,m) = s(n,m-1) - n * s(n,m)

I needed a more efficient method that can compute or approximate well
s(n,m) for large values of n and m (n about at most 1e7, m about 1e5)
without needing to compute all values up to the given values of n and
m.

thank you,
yw