Problem:
 Score : 100 points    Problem Statement Takahashi likes the sound when he buys a drink from a vending machine.  That sound can be heard by spending A yen (the currency of Japan) each time.  Takahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.  How many times will he hear the sound?      Constraints  All values in input are integers.  1 \leq A, B, C \leq 100         Input Input is given from Standard Input in the following format:  A  B  C       Output Print the number of times Takahashi will hear his favorite sound.        Sample Input 1 2 11 4      Sample Output 1 4  Since he has not less than 8 yen, he will hear the sound four times and be satisfied.       Sample Input 2 3 9 5      Sample Output 2 3  He may not be able to be satisfied.       Sample Input 3 100 1 10      Sample Output 3 0

Solution (Python):
import sys
import re
import math









INF = sys.maxsize


ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))





def main():
    a,b,c=ns()
    print(min(c, b//a))


if __name__ == '__main__':
    main()

Solution (Python):
def resolve():
  a, b, c = map(int, input().split())
  print(min(b//a, c))

  return

if __name__ == "__main__":
  resolve()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b, c = map(int, input().split())
    if c * a <= b:
        print(c)
    else:
        print(b // a)



if __name__ == '__main__':
    resolve()

Solution (Python):
a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
a,b,c = map(int,input().split())
print(min(c,b//a))

Solution (Python):
a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):
a,b,c=map(int,input().split())
print(min(b//a,c))

Solution (Python):
A,B,C = list(map(int, input().split()))

res = B//A

if res >= C:
    print(C)
else:
    print(res)

Solution (Python):
a,b,c=map(int,input().split())
if b/a>=c:
    print(c)
else:
    print(int(b/a))

Solution (Python):
a,b,c = map(int,input().split())
print(c if a*c<=b else b//a)

Solution (Python):
a, b, c = map(int, input().split())
if a * c <= b:
    print(c)
else:
    print(b//a)

Solution (Python):
A,B,C = map(int,input().split())
print(min(B // A, C))

Solution (Python):
A, B, C = map(int, input().split())
able = B // A
answer = min(able, C)
print(answer)

Solution (Python):
a,b,c=map(int,input().split())
print(min(b//a,c))

Solution (Python):
a,b,c = map(int,input().split())
if b > a*c:
    print(c)
else:
    print(b//a)

Solution (Python):
a, b, c = map(int, input().split())

print(min(c, b // a))

Solution (Python):
a,b,c = map(int, input().split())
print(min(c, b//a))

Solution (Python):
a,b,c = map(int,input().split())

print(min(b//a,c))

Solution (Python):
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)

if b//a>=c:
    print(c)

else:
    print(b//a)

Solution (Python):
a, b, c = [int(x) for x in input().split()]
print(min(b // a, c))

Solution (Python):
a, b, c = map(int, input().split())
for i in range(0, 101):
    if a > b or i == c:
        print(i)
        break
    b = b - a

Solution (Python):


A, B, C = map(int, input().split())

if B//A >= C:
    print(C)
else:
    print(B//A)

Solution (Python):


a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
a, b, c = map(int, input().split())
print(c) if b//a >= c else print(b//a)

Solution (Python):
a, b, c = [int(x) for x in input().split()]
print(c if b//a > c else b//a)

Solution (Python):
A, B, C = map(int, input().split())

if B // A > C:
    print(C)
else:
    print(B // A)

Solution (Python):
a,b,c=map(int,input().split())
print(min(c,b//a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b//a, c))

Solution (Python):
A,B,C = map(int, input().split())
if B//A < C:
    print(B//A)
else:
    print(C)

Solution (Python):
a,b,c=map(int,input().split())
if a*c<=b:
    print(c)
else:
    print(b//a)

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]




A, B, C = mi()

if A*C < B:
    print(C)
else:
    print(B//A)

Solution (Python):
a, b, c = map(int, input().split())
d = b//a
if d <= c:
    print(d)
else:
    print(c)

Solution (Python):


A, B, C = map(int, input().split())

print(min(B//A, C))

Solution (Python):
a,b,c=map(int,input().split(' '));print(min(b//a, c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b//a, c))

Solution (Python):

def solve():

    A, B, C = map(int, input().split())

    canListen = B//A

    print(min(canListen, C))


if __name__ == "__main__":
    solve()

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
import sys
import math
from collections import Counter
import itertools



def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

def LI(): return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



a,b,c=MI()
print(min(b//a,c))

Solution (Python):
a, b, c = map(int, input().split())
if b//a < c:
  print(b//a)
else:
  print(c)

Solution (Python):
a,b,c=map(int,input().split())
print(c if a*c<b else b//a)

Solution (Python):
a,b,c=map(int,input().split())

kai=b//a
print(min([kai,c]))

Solution (Python):
a,b,c = map(int,input().split())

kaisu = b // a

if kaisu >= c:
  print(c)
else:
  print(kaisu)

Solution (Python):
A, B, C = map(int, input().split())

if B >= A*C:
    print(C)
else:
    print(B//A)

Solution (Python):
import math
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
if b - (a * c) > 0:
  print(c)
else:
  print(math.floor(b / a))

Solution (Python):
def favorite_sound(a, b, c):

    return c if b//a > c else b//a
def main():
    a, b, c = map(int, input().split())
    print(favorite_sound(a, b, c))

if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
print(c if a * c <= b else b // a)

Solution (Python):
def resolve():
    a,b,c=map(int, input().split())
    print(min(c,b//a))
resolve()

Solution (Python):
def resolve():
    a,b,c=map(int, input().split())
    if b//a>=c:
        print(c)
    else:
        print(b//a)
resolve()

Solution (Python):
A,B,C = map(int,input().split())
print(min(C,B//A))

Solution (Python):

a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
a,b,c = map(int,input().split())

num = b//a

print(min(num,c))

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, C = il()
    print(min(C, B//A))


if __name__ == '__main__':
    main()

Solution (Python):
a,b,c = map(int,input().split())

if b // a >= c:
    print(c)
else: print(b // a)

Solution (Python):

import sys
input = sys.stdin.readline









A,B,C = map(int,input().split())

print(min(B//A,C))

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    x, y = divmod(B, A)
    if x < C:
        print(x)
    else:
        print(C)
if __name__ == "__main__":
    main()

Solution (Python):

a, b, c = map(int, input().split())
print(c) if a * c <= b else print(int(b / a))

Solution (Python):
a,b,c=[int(i)for i in input().split()]
d=b//a
print(min(d,c))

Solution (Python):
a,b,c=map(int,input().split())

s=b/a
s=int(s)
if(s>=c):
    print(c)

else:
    print(s)

Solution (Python):
A,B,C = map(int,input().split())
if A*C <= B:
  print(C)
elif A*C > B:
  print(int(B/A))

Solution (Python):
A,B,C = map(int,input().split())
print(min(B//A,C))

Solution (Python):
a,b,c = map(int, input().split())
print(min(b//a,c))

Solution (Python):
A, B, C = map(int, input().split())

print(min(C, B//A))

Solution (Python):
A, B, C = map(int, input().split())

print(min(C, B // A))

Solution (Python):

A,B,C = map(int,input().split())
ans = 0
if B // A < C:
  print(B//A)
else:
  print(C)

Solution (Python):
a,b,c=map(int,input().split())
total=b//a
if(total>=c):
    print(c)
else:
    print(total)

Solution (Python):
a,b,c = list(map(int,input().split()))
if b//a >= c:
    print(c)
else:
    print(b//a)

Solution (Python):
num = list(map(int, input().split()))

sound = num[1] // num[0]

if sound > num[2]:
  sound = num[2]

print(sound)

Solution (Python):
a,b,c = map(int,input().split())

if b//a >= c:
  print(c)
else:
  print(b//a)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()
print(B//A if B//A < C else C)

Solution (Python):
a,b,c=map(int,input().split())

d=b//a

if d < c:
    print(d)
else:
    print(c)

Solution (Python):
a,b,c = map(int, input().split())
if b//a >= c:
    print(c)
else:
    print(b//a)

Solution (Python):
a,b,c=map(int,input().split());print(min(b//a,c))

Solution (Python):
a, b, c = map(int, input().split())
if b - a*c > 0:
    print(c)
else:
    print(b//a)

Solution (Python):
a, b, c = map(int, input().split())
if b >= a*c:
    print(c)
else:
    print(b//a)

Solution (Python):
a,b,c=map(int, input().split())

m=b//a

if m>=c:
  print(c)
else:
  print(m)

Solution (Python):
a, b, c = map(int,input().split())

x = b // a

if x < c:
  print(x)
  
else:
  print(c)

Solution (Python):
import math

A, B, C = list(map(int, input().split()))

price = A
possession = B
maximum = C

number_of_purchases = min(math.floor(B / A), maximum)

print(number_of_purchases)

Solution (Python):
a, b, c = map(int, input().split())

if b // a < c:
    print(b//a)
else:
    print(c)

Solution (Python):

a, b, c = map(int, input().split())
print(min(b//a, c))

Solution (Python):
A, B, C = map(int, input().split())
if B//A >= C:
    print(C)
else:
    print(B//A)

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
time = B // A
answer = min(C, time)
print(answer)

Solution (Python):
a,b,c = map(int,input().split())
if b>=a*c:
  print(c)
else:
  print(b//a)

Solution (Python):
a,b,c=map(int,input().split())
print(c if b//a > c else b//a)

Solution (Python):
a=list(map(int,input().split()))
if a[1]//a[0]<a[2]:
    print(a[1]//a[0])
else:print(a[2])

Solution (Python):
A,B,C=map(int,input().split())
print(min(C,B//A))

Solution (Python):
a, b, c = map(int, input().split())
print(min((b//a), c))

Solution (Python):
a,b,c=map(int,input().split())
print(c if a*c<=b else b//a)

Solution (Python):
a,b,c = [int(x) for x in input().split()]
print(min(b//a,c))

Solution (Python):
a,b,c=map(int,input().split())

print(min(int(b/a),c))

Solution (Python):
A, B, C = map(int, input().split())

if B//A >= C:
  print(C)
else:
  print(B//A)

Solution (Python):
A, B, C = map(int, input().split())
if B//A > C:
  print(C)
else:
  print(B//A)

Solution (Python):
a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):
a,b,c = map(int,input().split())
if b//a >= c:
  print(int(c))
else:
  print(int(b//a))

Solution (Python):
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = i[2]
D = B // A

if D <= C:
  print(D)
else:
  print(C)

Solution (Python):
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = i[2]
D = B // A

if D <= C:
  print(D)
else:
  print(C)

Solution (Python):
line = input()
numbers = [int(n) for n in line.split()]
predicted_value = min(numbers[1]//numbers[0], numbers[2])
print(predicted_value)

Solution (Python):
def main():
    a, b, c = [int(x) for x in input().split()]
    times = b // a
    if times < c:
        print(times)
    else:
        print(c)
main()

Solution (Python):
a,b,c = input().split()

a = int(a)
b = int(b)
c = int(c)

if 1 <= a <= 100:
    if 1 <= b <= 100:
        if 1<= c <= 100:

            x = b / a
            if x >= c:
                print(int(c))
            else:
                print(int(x))

Solution (Python):
a,b,c=[int(x) for x in input().split()]
print(c if b//a>=c else b//a)

Solution (Python):
a, b, c = [int(x) for x in input().split()]

n = b // a

print(min(n, c))

Solution (Python):
line = input()
a, b, c = [int(n) for n in line.split()]
b = b/a
b = int(b)
if b>c:
    print(c)
else:
    print(b)

Solution (Python):
A, B, C = map(int, input().split())

if (A*C <= B):
	print(C)
else:
	ans = int(B/A)
	print(ans)

Solution (Python):
i = input().split()

i = list(map(int, i))

if i[0] * i[2] < i[1]:
    print(i[2])
else:
    print(int(i[1]/i[0]))

Solution (Python):
a,b,c = map(int, input().split())
if b >= a * c:
    print(c)
else:
    sound = 0 if b < a else int(b / a)
    print(sound)

Solution (Python):
a,b,c=[int(x) for x in input().split()]

if (b//a)>=c:
    print(c)
else:
    print(b//a)

Solution (Python):
numerosStr = input().split(" ")
numeros=[]
for i in numerosStr:
    numeros.append(int(i))

if numeros[1]/numeros[0] > numeros[2]:
    print(int(numeros[2]))
else:
    print(int(numeros[1]/numeros[0]))

Solution (Python):
line = input()
A, B, C = [int(n) for n in line.split()]
D = int(B/A)
if D >= C:
    print(C)
else:
    print(D)

Solution (Python):
line = input()
A,B,C = [int(n) for n in line.split()]
print(min(B//A,C))

Solution (Python):
a, b, c = map(int,input().split())
if b >= a*c:
  print(c)
else:
  print(b//a)

Solution (Python):
a,b,c=map(int,input().split())
print(min(b//a,c))

Solution (Python):
a,b,c=map(int,input().split())

d=b//a

if d>=c:
  print(c)
else:
  print(d)

Solution (Python):
icase=0
if icase==0:
    a,b,c=map(int,input().split())
    print(min(b//a,c))

Solution (Python):
A, B, C = map(int, input().split())
cnt = B//A
print(min(cnt, C))

Solution (Python):
A, B, C = map(int, input().split())

print(min(C, B // A))

Solution (Python):
a,b,c=map(int,input().split())
print(min(b//a,c))

Solution (Python):
a,b,c=map(int,input().split())
print(min(c,b//a))

Solution (Python):
A, B, C = map(int,input().split())
print(min(B//A, C))

Solution (Python):
a,b,c=map(int,input().split())
if b>a*c:
    print(c)
else:
    print(b//a)

Solution (Python):
A, B, C = map(int, input().split())
print(min(B//A, C))

Solution (Python):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b,c=MI()
print(min(int(b/a),c))

Solution (Python):
A,B,C = list(map(int,input().split()))
ans = min([B//A, C])
print(ans)

Solution (Python):
A = list(map(int, input().split()))
a = A[1]//A[0]
if a <= A[2]:
    print(a)
else:
    print(A[2])

Solution (Python):
a,b,c = map(int,input().split())
if b//a>=c: print(c)
else: print(b//a)

Solution (Python):
A, B, C = map(int, input().split())
print(min(C, B//A))

Solution (Python):
a,b,c=map(int,input().split())
if b//a>c:
    print(c)
else:
    print(b//a)

Solution (Python):
a,b,c=map(int,input().split())
x=b//a
if x>c:
  print(c)
else:
  print(x)

Solution (Python):
a,b,c = map(int,input().split())

print(min(b//a,c))

Solution (Python):
A, B, C = map(int, input().split())
print(min(B//A, C))

Solution (Python):
per_cost, possess, times = map(int, input().split())

ans = min(possess // per_cost, times)
print(ans)

Solution (Python):
per_cost, possess, times = map(int, input().split())

MAX_cost = times * per_cost

if (possess >= MAX_cost):
    ans = times
else:
    ans = possess // per_cost

print(ans)

Solution (Python):
import math
a,b,c=map(int, input().split())
print(min([math.floor(b/a),c]))

Solution (Python):
a,b,c = map(int,input().split())
if a*c <= b:
  print(c)
else:
  print(b // a)

Solution (Python):
import numpy as np
import sys

a, b, c = map(int, input().split())
d = b // a
if d >= c:
	print(c)
else:
	print(d)

Solution (Python):

a,b,c = map(int,input().split())

if (b//a) <= c:
    print(int(b//a))
else:
    print(c)

Solution (Python):
A,B,C=map(int,input().split())
print(C if B//A>=C else B//A)

Solution (Python):
a,b,c = map(int,input().split())
t = int(b/a)
if t<=c:
    print(t)
else:
    print(c)

Solution (Python):
A,B,C = map(int,input().split())

print(min(C,B//A))

Solution (Python):
A, B, C = map(int, input().split())
print(min(C, B//A))

Solution (Python):
a,b,c=list(map(int,input().split()))
print(min(b//a,c))

Solution (Python):
A,B,C = map(int,input().split())
print(min(B//A,C))

Solution (Python):
A,B,C = map(int,input().split())

if B < A*C:
  print(B//A)
else:
  print(C)

Solution (Python):
a, b, c = map(int, input().split())

if b >= a * c:
    print(c)
else:
    print(int(b//a))

Solution (Python):
A, B, C = map(int, input().split())
print(min(B//A, C))

Solution (Python):
a,b,c = list(map(int,input().split()))

sound_max = b//a

if c >= sound_max:
    print(sound_max)

elif c <= sound_max:
    print(c)

Solution (Python):
a,b,c = map(int, input().split())
if b//a < c:
    print(b//a)
else:
    print(c)

Solution (Python):
a, b, c = map(int, input().split())

if a*c < b: print(c)
else: print(b//a)

Solution (Python):
A,B,C=map(int,input().split())
if A*C<=B:
    print(C)
else:
    print(int(B/A))

Solution (Python):
a,b,c= map(int, input().split())
print(min(b//a,c))

Solution (Python):
A,B,C=map(int,input().split())
if B//A>C:
    print(C)
else:
    print(B//A)

Solution (Python):
a,b,c = map(int,input().split()) 
print(min(c,b//a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(c, b//a))

Solution (Python):
a,b,c=map(int,input().split())
print(b//a if a*c>=b else c)

Solution (Python):
a, b, c = map(int, input().split())
ans = b//a
print(ans if c>ans else c)

Solution (Python):
a, b, c = map(int, input().split())
print(min(c, b//a))

Solution (Python):
n,m,k = map(int, input().split())
print(min(m // n,k))

Solution (Python):













a,b,c = map(int,input().split())
ans = min(b//a,c)

print(ans)

Solution (Python):
A, B, C = map(int, input().split())

print(min(B//A,C))

Solution (Python):
a,b,c= map(int, input().split())
print(min(int(b/a),c))

Solution (Python):
a,b,c=map(int,input().split())
print(min(int(b/a),c))

Solution (Python):
a,b,c = map(int, input().split())

if b/a >= c:
    print(c)
else:
    print(int(b/a))

Solution (Python):
a,b,c= map(int,input().split())
 
if b//a >= c:
    print(c)
else:
    print(b//a)

Solution (Python):
import math
a, b, c = map(int, input().split())

if a > b:
    print(0)
else :
    if b >= a * c:
        print(c)
    else :
        print(math.floor(b/a))

Solution (Python):
import math
a, b, c = map(int, input().split())

if a > b:
    print("0")
else :
    if b >= a * c:
        print(c)
    else :
        print(math.floor(b/a))

Solution (Python):
A,B,C=list(map(int,input().split()))
print(min(B//A,C))

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    a, b, c = input_nums()
    if b//a > c: print(c)
    else: print(b//a)

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=[int(i) for i in input().split()]

print(min(c,b//a))

Solution (Python):
A, B, C = map(int, input().split())
n = B//A
if (n >= C):
    print(C)
else:
    print(n)

Solution (Python):
A,B,C = map(int,input().split())

L  = B // A
if L >= C:
    print(C)
else:
    print(L)

Solution (Python):
a,b,c = map(int, input().split())
print(c) if a*c<=b else print(b//a)

Solution (Python):

import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c = map(int, readline().split())
print(min(b // a, c))

Solution (Python):
A,B,C=map(int,input().split())
print(min(C,B//A))

Solution (Python):
a, b, c = map(int, input().split())
print(min(b // a, c))

Solution (Python):
a,b,c = map(int,input().split())

print(min(int(b/a),c))

Solution (Python):
a,b,c=map(int,input().split())
if b//a>c:
    print(c)
else:
    print(b//a)

Solution (Python):
x, y, z = map(int,input().split())
print(min(int(y/x), z))

Solution (Python):
a,b,c=map(int,input().split())
print(min(c,b//a))

Solution (Python):
A,B,C = map(int,input().split())
if B//A < C:
  print(B//A)
else:
  print(C)

Solution (Python):
a, b, c = map(int, input().split())

print(min(b // a, c))

Solution (Python):

A, B, C = map(int, input().split())
ans = 0
while B >= A:
    B -= A
    ans += 1
    if ans == C:
        break
        
print(ans)

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
print(min(c,b//a))

Solution (Python):
a,b,c = map(int,input().split())

print(min(b//a,c))

Solution (Python):
A, B, C = map(int,input().split())
print(min(C, B // A))

Solution (Python):
a,b,c=map(int,input().split())
if a*c<b:
    print(c)
else:
    print(b//a)

Solution (Python):
A,B,C = map(int,input().split())

if B>=A*C:
  print(C)
else:
  print(B//A)

Solution (Python):
a,b,c= map(int,input().split())

if b//a >= c:
    print(c)
else:
    print(b//a)

Solution (Python):
a,b,c=map(int,input().split())
print(min(c,b//a))

Solution (Python):
A, B, C = map(int, input().split())
print(min(B // A, C))

Solution (Python):
a,b,c = map(int,(input().split()))

result = b // a
if result > c:
    result = c

print(result)

Solution (Python):

a, b, c = [int(s) for s in input().split()]
print(c if b // a > c else b // a)

Solution (Python):
import math
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
n = math.floor(y/x)
if n >= z:
    print(z)
else:
    print(n)

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, c = map(int, readline().split())
  print(min(b//a, c))
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
a, b, c = map(int, input().split())
print(min(c, b // a))

Solution (Python):
A,B,C=map(int,input().split())
if A*C>B:
    print(B//A)
else:
    print(C)

Solution (Python):
import itertools
import fractions
def main():
  a,b,c = map(int,input().split())
  print(c if a*c <= b else b//a)
if __name__ == '__main__':
  main()

Solution (Python):
a, b, c = map(int, input().split())

kikeru = b//a

if kikeru >= c:
    ans = c
else:
    ans = kikeru
    
print(ans)

Solution (Python):
A,B,C = map(int,input().split())

if(B >= A*C):
    print(C)
else:
    print(B//A)

Solution (Python):
a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate
    
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    

    
    mod = 10**9 + 7

    a,b,c = map(int, input().split())
    print(min(c, b//a))

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
sound = b//a
print(sound if sound <= c else c)

Solution (Python):
a, b, c = map(int, input().split())
print(min(b//a, c))

Solution (Python):
import sys

a, b, c = map(int, sys.stdin.readline().split())

def main():
    res = min(b // a, c)
    print(res)

if __name__ ==  '__main__':
    main()

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a, b,c = map(int, input().split())

    print( min (b//a ,c))

Solution (Python):
a,b,c = map(int,input().split())
print(min(b//a,c))

Solution (Python):
A, B, C = map(int, input().split())

print(min(B//A, C))

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

a,b,c = iim()
print(min(b//a,c))

Solution (Python):
A,B,C = map(int,input().split())
ans = B//A
if ans >= C:
    print(C)
else:
    print(ans)

Solution (Python):
a,b,c = list(map(int,input().split()))

if c <= b/a:
  print(c)
else:
  print(b//a)

Solution (Python):
a,b,c= map(int,input().split())
if a*c<b :print(c)
else:print(b//a)

Solution (Python):
a,b,c=map(int,input().split());print(min(b//a,c))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

if A*C <= B:
	print(C)
else:
	print(B//A)

Solution (Python):
A,B,C= map(int,input().split())

x = B // A

if x <= C :
	print( x )
else:
	print( C )

Solution (Python):
A, B, C= map(int, input().split())
print(min(B//A,C))

Solution (Python):
A, B, C = map(int,input().split())

if B//A >= C:
  print(C)
else:
  print(B//A)

Solution (Python):
A,B,C=map(int,input().split())
max=B//A
print(min(max,C))

Solution (Python):
a, b, c = map(int, input().split())
if b//a < c:
  print(b//a)
else:
  print(c)

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

A, B, C = map(int, input().split())
print(min(C, B // A))

Solution (Python):
a,b,c = map(int,input().split())
print(int(b/a) if int(b/a)<c else c)

Solution (Python):
A, B, C = map(int, input().split())
print(C if A * C <= B else B // A)

Solution (Python):


A, B, C = map(int, input().split())


num = B // A


print(min(num, C))

Solution (Python):
A,B,C=map(int,input().split());print(min(C,B//A))

Solution (Python):
A,B,C=map(int,input().split())
print(min(C,B//A))

Solution (Python):
def main():
    from builtins import int, map, list, print, min
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    A,B,C = input_number_list()
    print(min(B//A,C))

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split());print(min(b//a,c))

Solution (Python):
a,b,c = map(int,input().split())
num = b // a
if num > c:
  num = c
print(num)

Solution (Python):
a,b,c=map(int,input().split())
print(min(b//a,c))

Solution (Python):
A, B, C = map(int, input().split())
print(min(C, B//A))

Solution (Python):
A, B, C = map(int, input().split())

print(min(B//A, C))

Solution (Python):
A, B, C = [int(x) for x in input().split()]
print(min(C, B // A))

Solution (Python):
A, B, C = [int(x) for x in input().split()]

if A * C <= B:
    ans = C
else:
    ans = B // A

print(ans)

Solution (Python):
A, B, C = map(int, input().split())
print(min(C, B // A))

Solution (Python):
import math

a,b,c=map(int,input().split())

if a*c<=b:
  print(c)
else:
  print(math.floor(b/a))

Solution (Python):
a,b,c=map(int,input().split())
print(min(c,b//a))

Solution (Python):
A, B, C = map(int, input().split())
print(C if B >= C*A else B//A)

Solution (Python):
def main():
    cost, budget, maxCount = map(int, input().split())
    ct = budget // cost
    print(min(maxCount, ct))
    

main()

Solution (Python):
import math
A,B,C = map(int,input().split())

if (B/A)>=C:
    print(C)
elif (B/A)<C:
    print(math.floor(B/A))

Solution (Python):
a, b, c = map(int, input().split())

if a * c <= b:
    print(c)
else:
    print(b // a)

Solution (Python):
a, b, c = map(int, input().split())
if b // a >= c:
    print(c)
else:
    print(b // a)

Solution (Python):


def main():
    a, b, c = map(int, input().split())
    
    if a * c <= b:
        print(c)
    else:
        print(b//a)

if __name__ == '__main__'    :
    main()

Solution (Python):
A,B,C = map(int,input().split())
if B >= A*C:
  print(C)
else:
  print(B//A)

Solution (Python):
a,b,c=map(int,input().split())
if b//a > c:
  print(c)
else:
  print(b//a)

Solution (Python):
A,B,C=map(int,input().split())
if B//A>=C:
    print(C)
else:
    print(B//A)

Solution (Python):
a,b,c = map(int, input().split())
n = min(b//a, c)
print(n)

Solution (Python):
a,b,c = map(int, input().split())

n = 0

for i in range(c + 1):
    if n < c and b - a >= 0:
        b = b - a
        n = n + 1
    else:
        print(n)
        break