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 sys
  import math
  import heapq
  from collections import defaultdict as dd
  from collections import OrderedDict as od
  from collections import deque
  from itertools import permutations as pp
  from itertools import combinations as cc
  from sys import stdin
  from functools import cmp_to_key
  from functools import lru_cache
  from bisect import bisect_left as bs_l
  from bisect import bisect_right as bs_r
  input = sys.stdin.readline
  mod=10**9+7
  sys.setrecursionlimit(10**5)
  T=int(input())
  for _ in range(T):
      k=int(input())
      i=1
      c=0
      while c<k:
          if i%3==0 or i%10==3:
              i+=1
          else:
              i+=1
              c+=1
      print(i-1)
  