#include <vector>
#include <deque>
#include <iostream>
#include <set>
#include <map>
using namespace std;

class Solution
{
  public:
  vector <int> findSubstring(string &s, vector <string> &p);
};

vector <int> Solution::findSubstring(string &s, vector <string> &p)
{
  vector <int> rv;
  return rv;
}

int main()
{
  string s, w;
  vector <string> p;
  vector <int> rv;
  Solution S;
  int i;

  cin >> s;
  while (cin >> w) p.push_back(w);

  rv = S.findSubstring(s, p);
  for (i = 0; i < rv.size(); i++) {
    if (i != 0) cout << " ";
    cout << rv[i];
  }
  cout << endl;
  return 0;
}