N1_ФТ

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}



int main() {
    /*ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);*/
    set <ll> ans;
    ll fr = 23100000;
    for (ll i = pow(10, 8); i < pow(10, 9); ++i) {
        ll x = i / pow(10, 5), y = i - x * pow(10, 5);
        ll k = (pow(10, 5) + 1) * (x + y);
        ll pw = pow(10, 6);
        if (i % pw == 0) {
            cout << i << "\n";
        }
        //cout << i << "\n";
        if (k >= fr && k <= fr + 140) {
            ans.insert(k);
            break;
        }
    }
    for (int i: ans) {
        cout << i << "\n";
    }
}