#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

typedef long long ll ;

typedef vector<ll> vl;

#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);

#define ff first

#define ss second

#define mp make_pair

#define line cout<<endl;

#define pb push_back

#define Endl "\n"

#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];

#define no cout<<"NO"<<endl;

#define yes cout<<"YES"<<endl;

#define all(V) (V).begin(),(V).end()

#define srt(V) sort(all(V))

#define srtGreat(V) sort(all(V),greater<ll>())

#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;

#define precision(x) cout<<fixed<<setprecision(x);

#define sz(V) ll(V.size())

template <typename T>

T mymax(T x,T y)

{

return (x>y)?x:y;

}

void kickstart()

{

ll test;

cin>>test;

for(ll i=1;i<=test;i++)

{

cout<<"Case #"<<i<<": ";

}

}

ll power(ll x,ll y,ll mod)

{

ll res=1;

// x=x%mod;

while(y>0)

{

if(y%2==1)

{

res*=x;

// res=res%mod;

}

y/=2; x*=x; // x=x%mod;

}

return res;

}

ll str_to_num(string s)

{

return stoi(s);

}

string num_to_str(ll num)

{

return to_string(num);

}

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

class Point

{

public:

ll x;

ll y;

ll z;

ll getsum()

{

return x+y+z;

}

};

ll solve()

{

vector< vector<ll> > binom(60, vector<ll>(64));

binom[0][0] = 1;

for (int i = 1; i < 60; ++i)

{

binom[i][0] = 1;

for (int j = 1; j < 60; ++j)

{

binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];

}

}

for (int i = 1; i < 60; ++i)

{

for (int j = 1; j < 60; ++j)

{

cout<<"ncr of "<<i<<" and "<<j<<" is "<<binom[i][j]<<endl;

}

}

return 0;

}

int main()

{

speed;

/* #ifndef ONLINE_JUDGE

ll TestCase=1;

cin>>TestCase;

while(TestCase--)

{

solve();

}

}