#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

int main(void)
{
    int a, b;
    cin >> a >> b;
    for (int i = a; i <= b; i++)
    {
        auto have3 = [&](int n)
        {
            while (n)
            {
                if (n % 10 == 3)
                {
                    return true;
                }
                n /= 10;
            }
            return false;
        };
        if (i % 3 == 0 || have3(i))
        {
            cout << i << endl;
        }
    }
}