Lower bound for sets in c++ stl quiz

Since 15 is not present so it should return the end iterator? the end iterator will be 6 or 7?
int main()
{
sets;
s.insert(1);
s.insert(5);
s.insert(7);
s.insert(2);
s.insert(12);
s.insert(10);
auto it = s.lower_bound(15);
cout<< *it <<endl;
return 0;
}
Please explain the output for this.