#include<vector>
#include<algorithm>
#include<iostream>
#include<conio.h>
#include<iterator>
#include<list>
#include<deque>
using namespace std;
template<class IteratorIntrarare>
void afisare(IteratorIntrarare it1,
				IteratorIntrarare it2) {
	IteratorIntrarare tmp;
	for (tmp = it1; tmp != it2; ++tmp) {
		cout << *tmp<<" ";
	}

	cout << endl;
}
int main() {
	deque<int> containerA;
	vector<int> containerB;
	list<int> containerC;

	for (int i = 1; i <= 10; i++) {
		if (i % 3 == 0)
			containerA.push_back(i);
	}

	for (int i = 1; i <= 10; i++) {
		if (i % 2 == 0)
			containerB.push_back(i);
	}

	for (int i = -10; i <= -1; i++)
		containerC.push_back(i);

	vector<int> rez1;
	vector<int> rez2;
	vector<int> rez3;

	//copy(containerA.begin(), containerA.end(), rez1.begin());
	//out of range error

	copy(containerA.begin(), containerA.end(),
		back_inserter(rez1));

	copy(containerB.begin(), containerB.end(),
		back_inserter(rez1));

	afisare(rez1.begin(),rez1.end());

	copy(containerB.begin(), containerB.end(),
		back_inserter(rez2));

	copy(containerA.begin(), containerA.end(),
		back_inserter(rez2));

	afisare(rez2.begin(), rez2.end());

	//c
	copy(containerB.begin(), containerB.end(),
		back_inserter(rez3));
	copy(containerA.begin(), containerA.end(),
		back_inserter(rez3));
	afisare(rez3.begin(), rez3.end());

	vector<int>::iterator poz=rez3.begin();
	++poz; ++poz; ++poz;

	list<int>::iterator sfarsitC = containerC.end();
	list<int>::iterator inceputC = containerC.end();
	inceputC--;	inceputC--;	inceputC--;	inceputC--;
	//copy(inceputC, sfarsitC, inserter(rez3, poz));

	list<int> inversare;
	copy(inceputC, sfarsitC, back_inserter(inversare));
	reverse(inversare.begin(), inversare.end());

	copy(inversare.begin(), inversare.end(), inserter(rez3, poz));
	afisare(rez3.begin(), rez3.end());
	_getch();
	return 0;


}