_{This problem is a programming version of Problem 238 from projecteuler.net}

Create a sequence of numbers using the pseudo-random number generator:

Concatenate these numbers   to create a string of infinite length.

Then,

For a positive integer , if no substring of exists with a sum of digits equal to , is defined to be zero. If at least one substring of exists with a sum of digits equal to , we define , where is the starting position of the earliest such substring. The string is -based indexed.

For instance:

The substrings "", "" and "" with respective sums of digits equal to , and start at position , hence .

The substrings "" and "" with respective sums of digits equal to and start at position , hence . Note that the substring "" starting at position , has a sum of digits equal to , but there was an earlier substring (starting at position ) with a sum of digits equal to , so , not .

Let .

Given two integers and , find modulo .