Calculate the difficulty of a Code Golf question Briefing
The difficulty of a Code Golf question can be calculated as such:
$$\text{clamp} \left( \left\lceil \left( \frac v a \div 700 \right) \times 10 \right\rceil, 0, 10 \right)$$
Where \$v\$ is the number of views a question has
and \$a\$ is the number of answers a question has
and \$⌈x⌉\$ is the ceiling operator.
Also:
$$\text{clamp}(x, min, max) = \begin{cases}
min &amp; x &lt; min \\
x   &amp; min \le x \le max \\
max &amp; max &lt; x
\end{cases}$$
This question's current difficulty: ***
Task
Write a program that will take two integers (v and a) and output the difficulty in asterisks (*).
The input can be in the form of an array, a separated string or as separate function arguments
Test Data
Views   Answers Difficulty  Program Output
163     2       2           **
548     22      1           *
1452    24      1           *
1713    37      1           *
4162    32      2           **
3067    15      3           ***
22421   19      10          **********

Example with pseudocode
v: 1713    
a: 37
out = clamp(ceil(((v/a)/700)*10), 0, 10); // evaluates to 1
//program will output '*'

The shortest code in bytes wins! Trailing/ leading spaces are allowed.
JavaScript (ES6), 40 39 bytes

v=&gt;a=&gt;"**********".substring(10-v/a/70)


Because substring provides the required clamping and "ceil"ing behaviour. Edit: Normally I'm too lazy to bother, but because it got 4 upvotes, I've followed @MarsUltor's advice to save 1 byte by currying.