public static void main(String[] args) {
		for (Integer prime: Euler.primeList(190)) {
			primes.add(BigInteger.valueOf(prime));
		}
		System.out.println(primes);
		System.out.println(primes.size());
		
		
		Set<BigInteger> set = new TreeSet<BigInteger>(new Comparator<BigInteger>() {
			@Override
			public int compare(BigInteger o1, BigInteger o2) {
				return o2.compareTo(o1);
			}
		});
		
		//TODO: rofl dette funker jo faktisk ikke og gaar i loop lizm xD
		set.addAll(primes);
		int i = 0;
		while(true) {
			BigInteger first = set.iterator().next();
			set.remove(first);
			if (++i % 100000 == 0) {
				System.out.println("------------------");
				System.out.println("Frste: "+first);
				System.out.println("Antall: " + set.size());
				System.out.println("Beste:  "+best);
				System.out.println("Goal:   "+goal);
				System.out.println("Ans:    "+best.mod(BigInteger.TEN.pow(16)));
			}
			for (BigInteger prime : primes) {
				BigInteger product = first.multiply(prime);
				if (product.compareTo(goal) < 0) {
					if (product.compareTo(toBig) >= 0) {
						if (product.compareTo(best) == 1) {
							best = product;
							System.out.println(product);
						}
					} else {
						set.add(product);
					}
				}
			}
		}
		
	}