#include
     
      #include
      
       #include
       
        #include
        
         using namespace std;const int maxn = 1005;struct node{    double a,b,c;}Node[maxn];//double a[maxn],b[maxn],c[maxn],d[maxn];int m,n,k;double mid;int cmp(const void *i,const void *j){    return (*(struct node *)i).c < (*(struct node *)j).c ? 1 : -1;}int main(){    //if(freopen("input.txt","r",stdin)== NULL)  {printf("Error\n"); exit(0);}    while(cin>>n>>k && n){         m = n - k;         for(int i=0;i
         
          >Node[i].a;        for(int i=0;i
          
           >Node[i].b; double p=0.5; while(true){ for(int i=0;i