public static void SolutionOptLocationBruteForce(){
        int cost[][]=new int[m][n];
        int min = getCostInXY(0,0);
        int x=0,y=0;

        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                cost[i][j] = getCostInXY(i,j);  //find all cost in every one place!
                if( min > cost[i][j]){
                    min = cost[i][j];
                    x = i;
                    y = j;
                }
            }
        }

        System.out.println("Location is: " + x + " " + y);
        System.out.println("Costs is: ");
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                System.out.print(cost[i][j]+" ");
            }
            System.out.println();
        }
    }