//math #include <bits/stdc++.h> using namespace std; typedef unsigned long long ll; ll n,m,k,mo=1000000007,f; inline ll qp(int a,int b) { //int ans=1; while(a&1) { if(b&1) a*=a%mo; a/=b%mo; } return a; } inline ll fac(int n) { ll ans=1; for(int i=2; i<=n; i++) ans*=i; return ans; } int main() { cin>>n>>k>>m; f=((fac(m)/fac(m-n))/fac(n))/2; cout<<100<<endl; return 0; }