public static void findFraction(int m, int n) {
		if (m <= 0 || n < m)
			throw new IllegalArgumentException();
		
		ArrayList<String> irreducible=new ArrayList<String>();
		ArrayList<String> reducible=new ArrayList<String>();
		
		for(int a=0;a<=m;a++){			
			for(int b=m;b<=n;b++){
				if(findGreatestCommonDivisor(b,a)==1){
					irreducible.add(a+"/"+b);
				}else{
					reducible.add(a+"/"+b);
				}
			}
		}
		
		System.out.println(Arrays.toString(irreducible.toArray(new String[0])));
		System.out.println(Arrays.toString(reducible.toArray(new String[0])));
	}