A gozinta chain for is a sequence where each element properly divides the next.
For example, there are eight distinct gozinta chains for : , , , , , , and .
Let be the sum of all numbers, , not exceeding , which have distinct gozinta chains.
You are given and .
Find , giving the last nine digits of your answer.
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.