#include <iostream>
    #include <deque>
    using namespace std;
    int main ()
    {
        deque<int> DequeData (6);  
        deque<int>::reverse_iterator RevIter = DequeData.rbegin();
        int k = 0;
        for (RevIter = DequeData.rbegin(); RevIter != DequeData.rend(); ++RevIter)
            *RevIter = ++k;
        for (deque<int> :: iterator iter = DequeData.begin();
        iter != DequeData.end(); ++iter)
        cout << ' ' << *iter;
        return 0;
    }