public Map<Integer, LinkedList<Integer>>    KsubLists(LinkedList<Integer>   list, ArrayList<Integer> centers){
    LinkedList<Integer> newList = new LinkedList<>();
    List<Integer> centerNew = new ArrayList<>();
    Map<Integer,LinkedList<Integer>> map = new HashMap<>();
    for(int i : list){
        newList.add(i);
    }
    for(int center : centers){
        centerNet.add(center);
    }
    Collections.sort(newList);
    Collections.sort(centerNew);
    while(!newList.isEmpty()){
        LinkedList<Integer> toAdd = new LinkedList<>();
        int centerNext = centerNew.get(0);
        centerNew.remove(centerNext);
        int low = Integer.MAX_VALUE;
        int before = Integer.MAX_VALUE;
        if(centerNew.isEmpty){
            newList.remove(centerNext);
            newList.addFirst(centerNext);
            map.put(centerNext,newList);
            break;
        }
        int centerNext2 = centerNew.get(0);
        boolean continue = true;
        while(true){
            int toPut = newList.get(0);
            if(Math.abs(centerNext2 - toPut) > Math.abs(centerNext - to Put)){
                toAdd.add(put);
                newList.remove(toPut);
            }else{
                continue = false;
            }
        }
        toAdd.remove(centerNext);
        toAdd.addFirst(centerNext);
        map.put(centerNext, toAdd);
    }
    return map;
}