<awangdev>Ugly Number_3.java
public long kthPrimeNumber(int k) {
    	if (k == 0) {
    		return 0;
    	}
        ArrayList<Long> set = new ArrayList<Long>();
    	PriorityQueue<Long> queue = new PriorityQueue<Long>();
    	queue.offer((long)3);
    	queue.offer((long)5);
    	queue.offer((long)7);
    	set.add((long)3);
    	set.add((long)5);
    	set.add((long)7);
    	long num = 0;
		for (int i = 0; i < k; i++) {
			num = queue.poll();
			
			if (!set.contains(num * 3)) {
			    queue.offer(num * 3);
			    set.add(num * 3);
			}
			if (!set.contains(num * 5)) {
			    queue.offer(num * 5);
			    set.add(num * 5);
			}
			if (!set.contains(num * 7)) {
			    queue.offer(num * 7);
			    set.add(num * 7);
			}
		}
		return num;
    }
public long sample_funcname ( int var_0 ) {
  if ( var_0 == 0 ) {
    return 0 ;
  }
  ArrayList < Long > var_4 = new ArrayList < Long > ( ) ;
  PriorityQueue < Long > var_6 = new PriorityQueue < Long > ( ) ;
  var_6 . offer ( ( long ) 3 ) ;
  var_6 . offer ( ( long ) 5 ) ;
  var_6 . offer ( ( long ) 7 ) ;
  var_4 . add ( ( long ) 3 ) ;
  var_4 . add ( ( long ) 5 ) ;
  var_4 . add ( ( long ) 7 ) ;
  long var_12 = 0 ;
  for ( int var_13 = 0 ;
  var_13 < var_0 ;
  var_13 ++ ) {
    var_12 = var_6 . poll ( ) ;
    if ( ! var_4 . contains ( var_12 * 3 ) ) {
      var_6 . offer ( var_12 * 3 ) ;
      var_4 . add ( var_12 * 3 ) ;
    }
    if ( ! var_4 . contains ( var_12 * 5 ) ) {
      var_6 . offer ( var_12 * 5 ) ;
      var_4 . add ( var_12 * 5 ) ;
    }
    if ( ! var_4 . contains ( var_12 * 7 ) ) {
      var_6 . offer ( var_12 * 7 ) ;
      var_4 . add ( var_12 * 7 ) ;
    }
  }
  return var_12 ;
}
