public static void printClosest(int[] a,int x,int k,int n){
                Arrays.sort(a);
                int l=0, r=n-1;
                while(r-l+1>k)
                        {
                                int f=a[l]-x;
                                if(f<0)f*=-1;

                                int s=a[r]-x;
                                if(s<0)s*=-1;


                                if(f>s)l++;
                                else r--;

                        }
                for(int i=l;i<=r;i++){
                        System.out.print(a[i]+" ");
                }
        }