public int threeSumClosest(int[] nums, int target) {
        int tmp = 2000;
        int summa = 0;
        for (int i = 0; i<nums.length; i++){
            for (int j = 0; i<nums.length; j++){
                if (j == i){
                    j++;
                }
                if (j >= nums.length-1) {
                    break;
                }
                for (int k = 0; k<nums.length; k++){

                    while (k == i || k == j){
                        k++;
                    }
                    if (k >= nums.length-1) {
                        break;
                    }
                    int summ = nums[i]+nums[j]+nums[k];
                    System.out.println("summ is " + summ);
                    System.out.println("tmp is " + tmp);


                    if (summ>target){
                        if (summ-target < tmp){
                            tmp = summ-target;
                            summa = summ;
                        }

                    } else if (summ<target){
                        if (target-summ < tmp) {
                            tmp = target-summ;
                            summa = summ;
                        }
                    }
                    System.out.println("now TMP is " + tmp);
                    System.out.println(" ");


                }
            }
        }
    return summa;
    }