#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

struct Sentence
{
    string ori, fixed;
    vector<string> words;

    Sentence(string s)
    {
        while(s.size() && s.back() == ' ')
            s.pop_back();
        reverse(s.begin(), s.end());
        while(s.size() && s.back() == ' ')
            s.pop_back();
        reverse(s.begin(), s.end());

        for(int i = 0, j = 0; i < s.length(); i++)
        {
            if(words.empty() || !words.back().empty())
                words.emplace_back();

            while(j < s.length() && s[j] != ' ' && s[j] != '.')
                fixed += s[j++], words.back() += fixed.back();

            if(fixed.size() && fixed.back() != ' ')
                fixed += ' ';

            i = j, j++;
        }

        if(words.size() && words.back().size() && !isalpha(words.back().back()))
            words.back().pop_back();

        this->ori = s;
        if(fixed.size())
            fixed.pop_back();
        for(auto &it: fixed)
            it = tolower(it);

        for(auto &it: words)
            for(auto &it2: it)
                it2 = tolower(it2);
    }

    bool contain(vector<string> &v)
    {
        bool ok = true;
        for(auto &it: v)
            ok &= (count(words.begin(), words.end(), it) != 0);
        return ok;
    }

};

vector<Sentence> parseQuery(string &line)
{
    string cur;
    vector<Sentence> v;
    for(int i = 0, j = 0; i < line.size(); i++)
    {
        while(j < line.size())
        {
            cur += line[j++];
            if(line[j - 1] == '?' || line[j - 1] == '!')
                break;

            if(line[j - 1] == '.')
            {
                int k = j;
                while(k < line.length() && line[k] == ' ')
                    k++;
                if(k < line.length() && islower(line[k]))
                    continue;
                break;
            }
        }
        if(cur.size())
            v.emplace_back(Sentence(cur)), cur.clear();
        i = j - 1;
    }
    return v;
}

void doWork()
{
    string line;
    getline(cin, line);
    string cur;
    vector<Sentence> v = parseQuery(line);

    int n;
    cin >> n;
    cin.ignore();
    for(int i = 0; i < n; i++)
    {
        getline(cin, line);
        auto q = parseQuery(line);
        //assert(q.size() == 1);

        cout << "Search results for \"" << line << "\":\n";
        for(auto &it: v)
        {
            if(it.contain(q[0].words))
                cout << "- \"" << it.ori << "\"\n";
        }
    }

}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}