bool comp(const deque<int>& a, const deque<int>& b)
{
    if (a.size() != b.size())
        return a.size() < b.size();
    int i = 0;
    while (i < a.size() && a[i] == b[i])
        i++;
    if (i < a.size())
    {
        return a[i] < b[i];
    }
}