#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e6+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	long long a,b;
	cin >> a >> b;
	vector<long long> v;
	for(long long i=a;i<=b;i++){
		if(i%3==0){
			v.push_back(i);
			continue;
		}
		long long temp=i;
		bool f=false;
		while(temp){
			if(temp%10==3){
				f=true;
				break;
			}
			temp/=10;
		}
		if(f)v.push_back(i);
	}
	sort(v.begin(),v.end());
	for(int i=0;i<v.size();i++){
		cout << v[i] << endl;
	}
	return 0;
}