/*
#include <iostream>
using namespace std;
int main()
{
int n,k,arr[100001],num=0,N=0;
cin>>n>>k;
int low = 0;
int high = n-1;
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
if(arr[n-1] < k)
{
cout<<n+1;
return 0;
}
for(;;)
{
int mid = (low+high)/2;
//cout << low << ',' << mid <<',' << high << endl;
if(mid == 0)
{
cout<<1;
return 0;
}
else if(low == high-1 && arr[mid] != k) {
while(arr[mid] < k) {
mid++;
}
if(arr[mid] > k && arr[mid-1] < k) {
cout << mid + 1;
return 0;
}
}
else if(arr[mid] == k)
{
while(arr[mid] == k && mid>=0)
mid--;
cout<<mid+2;
return 0;
}
else if(arr[mid] < k)
{
low=mid;
}
else if(arr[mid] > k)
{
high=mid;
}
}
}
*/
/*
#include <iostream>
using namespace std;
int main()
{
double a,b,x;
cin>>a>>b;
x=-(b/a);
cout<<fixed;
cout.precision(4);
cout<<x;
}
*/