import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

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

if __name__ == "__main__":
    main() import os os import sys sys from collections import defaultdict, Counter from itertools import product, permutations,combinations, accumulate from operator import itemgetter from bisect import bisect_left,bisect from heapq import heappop,heappush from math import ceil, floor, sqrt, gcd from copy import deepcopy def main():
    a,b,c = map(int, input().split())
    if b//a >= c:
        print(c)
    else:
        print(b//a)
     main a,b,c = map(int, input().split()) a map(int, input().split()) map int input().split() ().split () input split b c if b//a >= c:
        print(c)
    else:
        print(b//a)
     b//a >= c b//a b a c print(c) print c print(b//a) print b//a b a if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    a,b,c = map(int, input().split())
    if b//a >= c:
        print(c)
    else:
        print(b//a)
     def main():
    a,b,c = map(int, input().split())
    if b//a >= c:
        print(c)
    else:
        print(b//a)
     main
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

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

if __name__ == "__main__":
    main()