public static void find(int level, int multis[]){
		if(level == 5){
			int[] left = new int[4];
			int count = 0;
			for(int i = 0;i < bound; i++){
				if(!taken[i]) left[count++] = i+1;
			}
			int pro1 = (multis[0]*10+multis[1]) * (multis[2]*100 + multis[3]*10+multis[4]);
			if(varifyDigit(pro1, left)){
				System.out.println(" "+pro1);
				set.add(pro1);
			}
			int pro2 = multis[0] * (multis[1] * 1000 + multis[2]*100 + multis[3]*10+multis[4]);
			if(varifyDigit(pro2, left)){
				System.out.println(pro2);
				set.add(pro2);
			}
		}
		else{
			for(int i = 0; i < 9; i++){
				if(taken[i]) continue;
				taken[i] = true;
				multis[level] = i+1;
				find(level+1,multis);
				taken[i] = false;
			}
		}
	}