public static void qUp(Point p, Point up){
		if(up == Point.NULL || up.isObstacle || up.id != 0) return;
		else if(!up.leftFree && !up.rightFree){
			unprocessed.add(up);
			origins.add(p);
		}
		else if((!p.leftFree && !up.rightFree) || (!p.rightFree && !up.leftFree)){
			unprocessed.add(up);
			origins.add(p);
		}
		/*else if(up.row>0 && up.row<m-1 && up.column>0 && up.column<n-1){
			
		}*/
		else{
			queue.add(up);
		}
	}