#include<cstdio>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<vector>

using namespace std;

vector<int>a;

int b[];

int main(){

    a.push_back();

    a.push_back();

    a.push_back();

    a.push_back();

    int p=lower_bound(a.begin(),a.end(),)-a.begin();

    int q=lower_bound(a.begin(),a.end(),)-a.begin();

    printf("%d %d\n",p,q);// 0 2

    p=upper_bound(a.begin(),a.end(),)-a.begin();

    q=upper_bound(a.begin(),a.end(),)-a.begin();

    int r=upper_bound(a.begin(),a.end(),)-a.begin();

    printf("%d %d %d\n",p,q,r);// 2 3 4

    return ;

}

#include<cstdio>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<vector>

using namespace std;

vector<int>a;

int b[]={,,,};

int main(){

    int p=lower_bound(b,b+,)-b;

    int q=lower_bound(b,b+,)-b;

    printf("%d %d\n",p,q);// 0 2

    p=upper_bound(b,b+,)-b;

    q=upper_bound(b,b+,)-b;

    int r=upper_bound(b,b+,)-b;

    printf("%d %d %d\n",p,q,r);// 2 3 4

    return ;

}

#include<cstdio>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<vector>

#include<set>

using namespace std;

multiset<int>s;

int main(){

    s.insert();

    s.insert();

    s.insert();

    s.insert();

    set<int>::iterator p=s.lower_bound();

    set<int>::iterator q=s.lower_bound();

    printf("%d %d\n",*p,*q);// 1 2

    return ;

}