from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a)
if __name__ == '__main__':
  main() from statistics import median from fractions import gcd from itertools import combinations from collections import deque from collections import defaultdict import bisect bisect import sys sys sys.setrecursionlimit(10000000) sys.setrecursionlimit sys setrecursionlimit 10000000 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 def readInts():
  return list(map(int,input().split())) readInts return list(map(int,input().split())) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a) main a,b,c = readInts() a readInts() readInts b c print(c if a*c <= b else b//a) print c if a*c <= b else b//a a*c <= b a*c a c b c b//a b a if __name__ == '__main__':
  main() __name__ == '__main__' __name__ '__main__' main() main def readInts():
  return list(map(int,input().split())) def readInts():
  return list(map(int,input().split())) readInts def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a) def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a) main mod = 10**9 + 7 10**9 + 7 mod
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a)
if __name__ == '__main__':
  main()
