C_Neo_lexicographic_Ordering.cpp

#pragma GCC optimize ("trapv")
#include <bits/stdc++.h>
#include<algorithm>
#include <vector>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<cstdlib>
#include<sstream>
#include <string.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define  rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first 
#define ss second 
#define pp pair<ll,ll>
#define ll  long long
#define ld  long double
#define endl "\n"
map<char,char>mp;
 bool cmp(string &s1,string &s2){
     ll n=s1.size(),a=s2.size(),i;
     rep(i,0,min(n,a)){
         if(mp[s1[i]]<mp[s2[i]]) return true;
         else if(mp[s1[i]]>mp[s2[i]]) return false;
     }
     if(n<a) return true;
     else return false;
 }
const ll mod=1e9+7;
void solve()
{
ll  n, a=0,b=0,m=1, c=-1,k=0, i=0, j=0, l=1e9+5;
string s,p, q;
cin>>s>>n;
char hit='a';

rep(i,0,s.size()){
mp[s[i]]=i;
}
vector<string>v;
rep(i,0,n){
    cin>>q;
    v.pb(q);
}
sort(v.begin(),v.end(),cmp);
rep(i,0,n) cout<<v[i]<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin. tie(0);cout. tie(0);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
return 0;
}