Check B-powersmoothness from Wikipedia, a number is called B-powersmooth if all prime powers \$p^v\$ that divide the number satisfy \$p^v \leq B\$. B-powersmoothness is important, for example, for Pollard's p-1 factorization algorithm.
Task
your task is to get two numbers, \$n\$ and \$B\$, and output if \$n\$ is \$B\$-powersmooth.
Rules

You may take the input in any reasonable format
Since this is code-golf, the shortest code wins.
You can output a truthy/false value, or any two different values for true/false.
You can assume \$ 1 &lt; B, n \$.

Test cases
n, b -&gt; answer
3, 2 -&gt; 0
10, 7 -&gt; 1
123, 40 -&gt; 0
123, 41 -&gt; 1
64, 2 -&gt; 0
64, 32 -&gt; 0
64, 65 -&gt; 1
720, 5 -&gt; 0
720, 15 -&gt; 0
720, 16 -&gt; 1
20, 5 -&gt; 1
J, 14 13 bytes
&lt;[:&gt;./2^/@p:]

Try it online!
-1 byte thanks to @Jonah
A dyadic function. The right argument is \$n\$, the left argument is \$B\$. Returns 0 if \$n\$ is \$B\$-powersmooth, 1 otherwise.
How it works
&lt;[:&gt;./2^/@p:]  NB. left arg = B, right arg = n
      2   p:]  NB. Prime factorization of n,
               NB. given as a 2-row matrix of [primes, exponents]
       ^/@     NB. Evaluate all pi^ei for each prime factor
 [:&gt;./         NB. Maximum of all prime powers found above
&lt;              NB. 1 if the above is greater than B, 0 otherwise