#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +400500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
ll a, b, c, d, x, y, i;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> a >> b >> c >> d;
x = 0; y = 0;
if (c == 0 && d == 0)
{
cout << x << " " << y << el;
for (i = 1; i <= a / 2; i++) {x--; cout << x << " " << y << el;}
for (i = 1; i <= b / 2; i++) {y++; cout << x << " " << y << el;}
for (i = 1; i <= a / 2; i++) {x++; cout << x << " " << y << el;}
for (i = 1; i < b / 2; i++) {y--; cout << x << " " << y << el;}
}else
{
cout << x << " " << y << el;
for (i = 1; i <= c / 2; i++) {x++; y++; cout << x << " " << y << el;}
for (i = 1; i <= d / 2; i++) {x--; y++; cout << x << " " << y << el;}
for (i = 1; i <= c / 2; i++) {x--; y--; cout << x << " " << y << el;}
for (i = 1; i < d / 2; i++) {x++; y--; cout << x << " " << y << el;}
}
}
//
//1100000000
//1110000000
//0110000000
//0000000000
//0000000000
//0000000000
//0000000000
//0000000000
