#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<ll, ll> pl;
template<class T> using vec = vector<T>;

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define prt(x) cout << x << endl
#define var(x) ll x; cin >> x
#define SC(a, b) static_cast<a>(b)
#define elif else if
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define rrep(i, a, b) for(ll i = (a); i > (b); i--)
#define fill(arr, n) for(ll i = 0;i < n;i++) cin >> arr[i]

#define X first
#define Y second
#define PB push_back
#define MP make_pair

const ll mod = SC(ll, 1e9 + 7);
const long double pi = 3.1415926535897932384626433832795;
const ll inf = SC(ll, 1e18 + 1);
const ll ninf = -1*inf;

// #define TC

ll calc(ll n){
    ll ret = 0;
    rep(i, 1, n + 1){
        ll temp = n - i + 1;
        temp *= temp;
        temp *= i;
        ret += i;
    }
    cout << ret << " ";
    return ret;
}

void solve(){
    var(a); var(b); var(c);
    while(a--){ 
        string str; cin >> str;
    }
    cin >> a >> b >> c >> a;
    cout << 0 << endl;
}

void input(){}

void preprocess(){}

int main(){
	preprocess();
#ifdef TC
	ll t; cin >> t; while(t--){ input(); solve(); }
#else
	input();
	solve();
#endif
	return 0;
}