description: Polycarp doesn't like integers that are divisible by 3 or end with the digit 3 in their decimal representation. Integers that meet both conditions are disliked by Polycarp, too.
  
  Polycarp starts to write out the positive (greater than 0) integers which he likes: 1, 2, 4, 5, 7, 8, 10, 11, 14, 16, .... Output the k-th element of this sequence (the elements are numbered from 1).
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.
  
  Each test case consists of one line containing one integer k (1 ≤ k ≤ 1000).
  
  Output
  
  For each test case, output in a separate line one integer x — the k-th element of the sequence that was written out by Polycarp.
  
  Example
  
  Input
  
  
  10
  1
  2
  3
  4
  5
  6
  7
  8
  9
  1000
  
  
  Output
  
  
  1
  2
  4
  5
  7
  8
  10
  11
  14
  1666
solution: import java.util.Scanner;
  import java.util.ArrayList;
   
  public class Rough{
      public static void main(String[] args){
          Scanner sc = new Scanner(System.in);
          int test_cases = sc.nextInt();
          ArrayList<Integer> a1 = new ArrayList<Integer>();
          for(int j = 1; j<= 1666;j++)
              if(j%3 == 0 || j%10 == 3)
                  continue;
              else
                  a1.add(j);
          for(int i=0; i<test_cases; i++){
              int k_th = sc.nextInt();
              
              System.out.println(a1.get(k_th-1));
          }
      }
  }