#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>

using namespace std;

vector<int> a;
lower_bound(a.begin(), a.end(), x) - указатель на первый элемент >= x
upper_bound(a.begin(), a.end(), x) - указатель на первый элемент > x

/*int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int y;
    cin >> y;
    int l = 0, r = n;
    while (l != r - 1) {
        int m = (l + r) / 2;
        if (a[m] <= y) {
            l = m;
        }
        else {
            r = m;
        }
    }
    cout << "Last number smaller or equal to y is " << l << ' ' << a[l] << endl;
    l = -1;
    r = n - 1;
    while (l != r - 1) {
        int m = (l + r) / 2;
        if (a[m] >= y) {
            r = m;
        }
        else {
            l = m;
        }
    }
    cout << "First number greater or equal to y is " << r << ' ' << a[r] << endl;
    system("pause");
    return 0;
}*/

/*const double PI = 3.14159265;
//y = cos(x) / k

long double f(long double x, long double k) {
    return cos(x) / k;
}

int main() {
    long double k, y;
    cin >> k >> y;
    long double l = PI, r = 2 * PI;
    for (int i = 0; i < 50; ++i) {
        long double m = (l + r) / 2;
        if (f(m, k) > y) {
            r = m;
        }
        else {
            l = m;
        }
    }
    cout << l << endl;
    system("pause");
    return 0;
}*/