This is a code golf version of a similar question [I asked on stack earlier][1] but thought it'd be an interesting puzzle.

Have a **10-length** string starting from 

[![0000000000][2]][2]

Iterate through till you get to

[![0000000009][3]][3]

Then start using letters in place to get 36 total iterators

[![loop 25 times to 10][4]][4]

Then push to the next character

[![000000010][5]][5]

And repeat. 

> The goal of this puzzle is to get the least amount of bytes and create a base-36 iterator, **the cycling engine** for a loop that is able to convert any string into the next string.

> There should be a total of 3,656,158,440,062,976 (3 quadrillions) but I don't expect you to iterate through all of them ;-)

> Bonus points if you can take the string and get the exact iteration it is upto.


  [1]: https://stackoverflow.com/questions/51492374/get-the-point-where-the-replace-occurred-in-a-replace#51493248
  [2]: https://i.sstatic.net/xJCCi.png
  [3]: https://i.sstatic.net/T9xbJ.png
  [4]: https://i.sstatic.net/Zp1NC.png
  [5]: https://i.sstatic.net/QCnGq.png