#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define mt make_tuple
int xe, ye, xh, yh, c, d, dr[] = {-1, 0, 0, 1}, dc[] = {0, -1, 1, 0};
vector<pair<int, int> > hor, ver, mv;
set<pair<int, int> > s;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> xe >> ye >> xh >> yh >> d;
c = llabs(xe - xh) + llabs(ye - yh);
if ((c > d || (c & 1) ^ (d & 1)) || (c == 1 && c ^ d)) return cout << "impossible\n", 0;
if (llabs(xe - xh) == 1 && llabs(ye - yh) == 1) {
if ((d - 2) % 4 != 0) return cout << "impossible\n", 0;
d = 2 * ((d - 2) / 4 + 1);
}
if (yh > ye) {
swap(xe, xh);
swap(ye, yh);
}
if (xe == xh) {
for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, ye);
for (int i = ye; i >= yh; i--) mv.emplace_back(xe + (d - c >> 1), i);
for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, yh);
} else if (ye == yh) {
if (xh > xe) swap(xe, xh);
for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xh, i);
} else if (xe >= xh) {
for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
} else {
for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
for (int i = xe; i <= xh; i++) mv.emplace_back(i, ye + (d - c >> 1));
for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
}
sort(mv.begin(), mv.end());
for (auto i : mv)
for (int k = 0; k < 4; k++)
if (!binary_search(mv.begin(), mv.end(), mp(i.first + dr[k], i.second + dc[k]))) s.emplace(i.first + dr[k], i.second + dc[k]);
cout << s.size() << '\n';
for (auto i : s) cout << i.first << ' ' << i.second << '\n';
}
