#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

ll A, B;

bool is_3contain(ll x) {
	while (x > 0LL) {
		if (x % 10LL == 3LL) {
			return true;
		}
		x /= 10LL;
	}
	return false;
}

bool is_3times(ll x) {
	return x % 3LL == 0;
}

int main() {
	cin >> A >> B;
	for (ll i = A; i <= B; i++) {
		if (is_3contain(i) || is_3times(i)) {
			printf("%lld\n", i);
		}
	}
	return 0;
}