Draw a distribution diagram! Challenge

You are given three integers as input - min_value, max_value, sample_size, that you can pass to your answer as either array or several parameters.

Your task is to output a diagram in any convenient format, that shows the frequency of numbers in the (min_value, max_value) range showing up when a random number in the (min_value, max_value) range is picked sample_size times. The random number sequence should be generated within your answer.

With large ranges and sample sizes, you're free to change the steps your diagram uses, as long as the representation remains accurate.

Example

With [1, 5, 10] as input:

o o o x o
x o x x x
x x x x x
1 2 3 4 5


With [1, 100, 15] as input (in steps of 10, so 00 shows 1-9, 10 shows 10-19, etc.):

xx oo oo xx oo xx oo oo oo oo
xx oo oo xx oo xx xx oo oo oo
xx xx oo xx xx xx xx xx xx oo
00 10 20 30 40 50 60 70 80 90


Scoring

This is code-golf, so shortest code in bytes wins.
Octave, 34 32 bytes



@(a,b,n)hist(--a+randi(b-a,n,1))


Doesn't work on TIO, but works on Octave-online.net.

It creates a histogram (bar chart) looking like this:



I'd say that counts as "Any convenient format".

If non-zero bins must be shown, then this can be solved in 38 bytes: 

@(a,b,n)hist(--a+randi(b-a,n,1),a+1:b)