import sys
import re
import math

# import bisect

# import copy
# import heapq
# from collections import deque
# import decimal

# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7

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


# ===CODE===


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


if __name__ == '__main__':
    main() import sys sys import re re import math math INF = sys.maxsize INF sys.maxsize sys maxsize ni = lambda: int(sys.stdin.readline()) ni lambda: int(sys.stdin.readline()) int(sys.stdin.readline()) int sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline ns = lambda: map(int, sys.stdin.readline().split()) ns lambda: map(int, sys.stdin.readline().split()) map(int, sys.stdin.readline().split()) map int sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split na = lambda: list(map(int, sys.stdin.readline().split())) na lambda: list(map(int, sys.stdin.readline().split())) list(map(int, sys.stdin.readline().split())) list map(int, sys.stdin.readline().split()) map int sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split def main():
    a,b,c=ns()
    print(min(c, b//a)) main a,b,c=ns() a ns() ns b c print(min(c, b//a)) print min(c, b//a) min c b//a b a if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main ns = lambda: map(int, sys.stdin.readline().split()) lambda: map(int, sys.stdin.readline().split()) ns INF = sys.maxsize sys.maxsize INF na = lambda: list(map(int, sys.stdin.readline().split())) lambda: list(map(int, sys.stdin.readline().split())) na ni = lambda: int(sys.stdin.readline()) lambda: int(sys.stdin.readline()) ni def main():
    a,b,c=ns()
    print(min(c, b//a)) def main():
    a,b,c=ns()
    print(min(c, b//a)) main
import sys
import re
import math

# import bisect

# import copy
# import heapq
# from collections import deque
# import decimal

# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7

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


# ===CODE===


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


if __name__ == '__main__':
    main()
