public void oldChangeCombination() throws IOException{
		int compLevel = compositionLevel;
		int countLevel[] = initWithValueOne(compositionLevel-1);
		int combinationRecBlock[] = initWithValueOne(compositionLevel);
		boolean pause = false; //avoid repeating combinations 
		int counter = 0;
		
		while(countLevel[0] < Math.pow(2,servicesByLevel[0]) && compLevel > 0){
			//if(!pause){
			if(counter == 0){
				for(int i = 1; i <= (Math.pow(2,servicesByLevel[compLevel-1])-1);i++){
					combinationRecBlock[compLevel-1] = i;
					System.out.println(String.valueOf(combinationRecBlock[0])+String.valueOf(combinationRecBlock[1])+String.valueOf(combinationRecBlock[2])+String.valueOf(combinationRecBlock[3])+String.valueOf(combinationRecBlock[4]));
					getCombinationServices(convertToBinary(combinationRecBlock));
				}	
			}
			else{
				counter--;
			//	pause = false;
			}
			compLevel--;
			
			while(compLevel > 0){
				if(countLevel[compLevel-1] < (Math.pow(2,servicesByLevel[compLevel-1])-1)){
					countLevel[compLevel-1] += 1;
					combinationRecBlock[compLevel-1] = countLevel[compLevel-1];
					compLevel = compositionLevel;
					break;
				}
				else{
					if(compLevel==4)counter = 1;
					if(compLevel==3)counter = 4;
					if(compLevel==2)counter = 4;
					combinationRecBlock[compLevel-1] = 1;
					countLevel[compLevel-1] = 0;
					compLevel--;
					//pause = true;
				}
			}
			
		}
		//printSolutions();
		exportSolutions(FTT.RBLOCK);
		System.out.println("Number of solutions:" + solution.size());
	}