n, k, t = map(int, input().split())
print(t if t <= k else k if k < t < n else n+k-t)
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author yassin
*/
#include <bits/stdc++.h>
using namespace std;
class TaskA {
public:
void solve(istream& in, ostream& out) {
int n, k, t;
in >> n >> k >> t;
if (t <= k) {
out << t << "\n";
} else if (t <= n) {
out << k << "\n";
} else {
out << (n + k) - t << "\n";
}
}
};
int main() {
std::ios::sync_with_stdio(false); cin.tie(nullptr);
TaskA solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
714B - Filya and Homework | 31A - Worms Evolution |
1691A - Beat The Odds | 433B - Kuriyama Mirai's Stones |
892A - Greed | 32A - Reconnaissance |
1236D - Alice and the Doll | 1207B - Square Filling |
1676D - X-Sum | 1679A - AvtoBus |
1549A - Gregor and Cryptography | 918C - The Monster |
4B - Before an Exam | 545B - Equidistant String |
1244C - The Football Season | 1696B - NIT Destroys the Universe |
1674A - Number Transformation | 1244E - Minimizing Difference |
1688A - Cirno's Perfect Bitmasks Classroom | 219A - k-String |
952A - Quirky Quantifiers | 451B - Sort the Array |
1505H - L BREAK into program | 171E - MYSTERIOUS LANGUAGE |
630D - Hexagons | 1690D - Black and White Stripe |
1688D - The Enchanted Forest | 1674C - Infinite Replacement |
712A - Memory and Crow | 1676C - Most Similar Words |