#include <iostream>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;

int has3(int n){
  do{
    if(n % 10 == 3){ return 1; }
    n /= 10;
  }while(n != 0);
  return 0;
}

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