#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <limits>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl

struct Element{
    LLI Value;
    vector<int> R;
};

Element dp[1001][2];

int N;
vector<int> V;

bool ContainThree(LLI value)
{
    while(value > 0)
    {
        if(value % 10 == 3)
        {
            return true;
        }
        value /=10;
    }
    return false;
}

int main()
{
    LLI A,B;
    cin >> A >> B;
    for(LLI i = A;i <= B;i++)
    {
        if(i % 3 == 0 || ContainThree(i))
        {
            cout << i << endl;
        }
    }
    return 0;
}