#!/usr/bin/python3
# -*- coding: utf-8 -*-

"""
print 9,999,999 unique unordered "phone numbers" - 7-digit sequences

"""
m = 9999999  # max number
s = 1046527  # Carol prime: 7, 47, 223, 3967, 16127, 1046527, ...
l = len(str(m))
ni= 5  # initial number
n = 1  # number 0..0 (all zeroes) is not used

while n <= m:
  ni = ni-m if m < ni else ni
  # print(f'{ni:0{l}}', end=" ")
  print(f'{ni:0{l}}')
  ni = ni + s
  n = n + 1