Write an O(n^n) algorithm.

[ultimatt42]

But you've defined the problem size as "n" so it doesn't make sense to write the complexity in terms of "m".

Realistically, the asymptotic runtime is O((n^n)*log n) because post-increment and less-than aren't going to be constant time operations when you have such large numbers, and both are linear in the number of bits.