#include <iostream>
#include <string>
#include <vector>
#include <fstream>
#include <algorithm>
#include <sstream>


using namespace std;

class Sloupec;

template <class T> bool porovnejsecond(pair<int, T> a , pair<int, T> b ) {
	if (a.second < b.second) {
		return  true;
	} else {
		return false;
	}
}

/*
bool porovnejsecond(pair<int, string> a , pair<int, string> b ) {
	if (a.second <= b.second) {
		return  true;
	} else {
		return false;
	}
}
*/





template <class T> class compfirst {
public:
	compfirst(int i) {
		i_ = i;
	}
	bool operator() (pair<int, T> x) {
		if ( x.first == i_ ) {
			return true;
		} 
		return false;
	}
	/*
	bool operator() (pair<int, int> x) {
		if ( x.first == i_ ) {
			return true;
		} 
		return false;
	}
	bool operator() (pair<int, string> x) {
		if ( x.first == i_ ) {
			return true;
		} 
		return false;
	}
	*/
private:
	int i_ ;
};



char separator = '#';

//vektor parametru podle kterych to mam tridit - int udava sloupec a char udava podle ceho.

vector< pair<int, char> > parametry;
vector < Sloupec *> text;

class Sloupec {
	//tady bude nejaka virtualni fce
public:
	virtual string nacti(int radek, string retez) = 0;
	virtual vector<int> sort() = 0;
	virtual void vypis(int j, ostream & kam) = 0;
	virtual void innersort(vector<int> poradi) = 0;
	virtual int delka() = 0;
};

class SloupecInt : public Sloupec {
public:
	virtual string nacti(int radek, string retez);	
	virtual vector<int> sort();
	virtual void vypis(int j, ostream & kam);
	virtual void innersort(vector<int> poradi);
	virtual int delka() {
		return sloupec.size();
	}
private:
	vector<pair<int, int> > sloupec; // v prvnim je cislo radku, v druhem je hodnota
};

vector<int> SloupecInt::sort() {
	vector <int> noveporadi;
	stable_sort(sloupec.begin(), sloupec.end(),porovnejsecond<int>);
	for ( int i = 0; i < sloupec.size(); i++ ) {
		noveporadi.push_back(sloupec[i].first);
	}
	return noveporadi;
}




void SloupecInt::innersort(vector<int> poradi) {
	vector <pair <int, int> > novyvektor;
	vector< pair <int, int> >::iterator it;
	for (int i = 0; i < poradi.size(); i++ ) {
		compfirst<int> x(poradi[i]);
		it = find_if(sloupec.begin(), sloupec.end(), x);
		novyvektor.push_back(*it);
	}
	sloupec.clear();
	sloupec = novyvektor;
}

string SloupecInt::nacti(int radek, string retez) {
	stringstream str;
	string temp;
	int b;
	int a = retez.find(";");
	temp = retez.substr(0,a);
	str << temp;
	str >> b;
	sloupec.push_back(make_pair(radek,b));
	return retez.substr(a+1);
}

void SloupecInt::vypis(int j, ostream & kam) {	
	kam << sloupec[j].second;
}

class SloupecString : public Sloupec {
public:
	virtual string nacti(int radek, string retez);
	virtual void innersort(vector<int> poradi);
	virtual vector<int> sort();
	virtual void vypis(int j, ostream & kam);
	//bool porovnejsecond(pair<int, string> a , pair<int, string> b );
	virtual int delka() {
		return sloupec.size();
	}
private:	
	vector<pair<int, string> > sloupec; //v prvni je cislo radku, v druhem je string [hodnota]
};	

vector<int> SloupecString::sort() {
	vector <int> noveporadi;	
	stable_sort(sloupec.begin(), sloupec.end(),porovnejsecond<string>);
	for ( int i = 0; i < sloupec.size(); i++ ) {
		noveporadi.push_back(sloupec[i].first);
	}
	return noveporadi;
}



string SloupecString::nacti(int radek, string retez) {	
	string temp;
	int b;
	int a = retez.find(";");
	temp = retez.substr(0,a);	

	sloupec.push_back(make_pair(radek,temp));
	return retez.substr(a+1);
}

void SloupecString::innersort(vector<int> poradi) {
	vector <pair <int, string> > novyvektor;
	vector< pair <int, string> >::iterator it;
	for (int i = 0; i < sloupec.size(); i++ ) {
		compfirst<string> x(poradi[i]);
		it = find_if(sloupec.begin(), sloupec.end(), x);
		novyvektor.push_back(*it);
	}
	sloupec.clear();
	sloupec = novyvektor;
}


void SloupecString::vypis(int j, ostream & kam) {	
	kam << sloupec[j].second;
}


void rozparsuj( ifstream & input, ofstream & output ) {
	Sloupec * sloupec;

	string retez, temp;
	int s = 1;
	int radek = 1;
	vector<pair<int, char> >::iterator it;

	//nejdriv zjistim kolik je tam sloupcu, vytvorim si prislusne sloupce a pak do nich jen budu pridavat;
	getline(input,retez);
	if (input.eof() ) { //nebyl tam ani jeden sloupec
		cout << "nejaka chyba ve vstupnim souboru, curys" << endl;
		return;
	}
	int nasel = 0;
	int a = 0;
	temp = retez;
	while ( a != -1 ) {
		a = temp.find(";");
		temp= temp.substr(a+1);		
		nasel++;
	}	
	for ( int i = 1; i <= nasel; i++ ) {
		compfirst<int> exsl(i);
		it = find_if(parametry.begin(), parametry.end(), exsl );
		if ( it != parametry.end() ) { // nasel jsem nejakej sloupec podle ktereho to mam resit
			switch ( (*it).second ) {
				case 'S' :
					sloupec = new SloupecString;
					break;
				case 'N' :
 					sloupec = new SloupecInt;
					break;
				default:
					sloupec = new SloupecString;
					break;
			}			

		} else {
			sloupec = new SloupecString;
		}
		text.push_back(sloupec);
	}

	a = 0;

	while( input ) { 				
		for ( s = 0; s < text.size(); s++ ) {	
			retez = (text[s])->nacti(radek, retez);
		}					
		if (input.eof() ) {
			break;
		}		
		getline(input,retez);
		radek++;
	}
}

void vypistext(ostream & kam) {
	int a = text.size();

	for ( int j = 0; j < text[0]->delka(); j ++ ) {
		for ( int i = 0; i < a; i++ ) {
			text[i]->vypis(j, kam);
			if ( (i+1) != a ) {
				kam << separator;
			} else {
				kam << endl;
			}
		}
	}
}


void zesorti() {
	vector< pair<int, char> >::iterator it;
	vector< int > poradi;

	for (int i = parametry.size(); i > 0; i--) {
		poradi = text[parametry[i-1].first - 1]->sort();
		for (int j = 0; j < text.size(); j++) {
			text[j]->innersort(poradi);
		}
		vypistext(cout);
		cout << endl;
	}
}

int main (int argc, char * * argv ) {
string retez;
ifstream input; // = cin;
ofstream output; // = cout;
stringstream str;
pair <int, char > mapka;
char znak;
int cislo;
	for (int i = 1; i < argc; i++) {
		retez = argv[i];
		if ( ! retez.compare("-i") ) {
			i++;			
			input.open(argv[i], ios::in);
			if ( input.fail() ) {
				cout << "chybny vstupni soubor, asi neexistuje, koncim" << endl;
				return -1;
			}	
		} else if ( ! retez.compare("-o") ) {		
			i++;
			output.open(argv[i], ios::out);
			if ( output.fail() ) {
				cout << "nemuzu vytvorit vstupni soubor!" << endl;
				return -1;
			}	
		} else if ( ! retez.compare("-t") ) {
			i++;
			separator= argv[i][0];
		} else { //nacitam uz parametry podle kterych tridit
			znak = retez[0];
			retez = retez.substr(1);
			str.clear();
			str << retez;
			str >> cislo;			
			parametry.push_back(make_pair(cislo,znak));
		}
	}
	//nacetl jsem vsutpni parametry jdu tedka parsovat soubor...
	rozparsuj(input, output);	
	zesorti();	
	vypistext(output);	
}