#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<ll> ans;

void calc(ll x){

	ll s=x;

	if(x % 3==0){
		ans.push_back(x);
		return;
	}

	while(x/10 !=0){

		int a = x%10;

		x /=10;


		if(a == 3){
			ans.push_back(s);
			return;
		}
	}
	if(x ==3){
		ans.push_back(s);
	}

}



int main() {

	ll a ,b;
	cin>>a>>b;

	for(ll i=a; i<=b; i++){
	calc(i);

	}

	for(int i=0; i<ans.size(); i++){
		cout<<ans[i]<<endl;
	}

	return 0;
}