#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

const int N = 2e5 + 100;

int L[N], R[N];

struct work {
    int l, r, x, y;
} a[N];

inline bool cmp(work x, work y) { return x.l < y.l; }

vector <pair<int, int> > ans;

priority_queue<pair<int, int> > q;

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int n, m;
    read(n); read(m);
    F(i, 1, n + m - 1) {
        int li, ri;
        if (i <= n) li = i; else li = n;
        if (i <= n) ri = 1; else ri = i - n + 1;
        L[i] = ri - li + 100000;
        if (i <= m) li = 1; else li = i - m + 1;
        if (i <= m) ri = i; else ri = m;
        R[i] = ri - li + 100000;
    }
    int cnt = 0, MX = 0;
    for (int i = 1; i <= n + m - 1; i += 2) {
        ++cnt;
        a[cnt].l = L[i] / 2 + 1;
        a[cnt].r = R[i] / 2 + 1;
        int li, ri;
        if (i <= n) li = i; else li = n;
        if (i <= n) ri = 1; else ri = i - n + 1;
        a[cnt].x = li;
        a[cnt].y = ri;
        checkmax(MX, a[i].r);
    }
    sort(a + 1, a + cnt + 1, cmp);
    int pos = a[1].l, now = 0, it = 0;
    while (1) {
        while (a[now + 1].l <= pos && now + 1 <= cnt) { ++now; q.push(make_pair(-a[now].r, now)); }
        while (!q.empty() && -q.top().first < pos) q.pop();
        ++ it;
        if (it > 250000) break;
        if (q.empty()) continue;
        int i = q.top().second; q.pop();
        ans.emplace_back(make_pair(a[i].x - (pos - a[i].l), a[i].y + (pos - a[i].l)));
        ++pos;
    }
    cnt = 0, MX = 0;
    for (int i = 2; i <= n + m - 1; i += 2) {
        ++cnt;
        a[cnt].l = L[i] / 2 + 1;
        a[cnt].r = R[i] / 2 + 1;
        int li, ri;
        if (i <= n) li = i; else li = n;
        if (i <= n) ri = 1; else ri = i - n + 1;
        a[cnt].x = li;
        a[cnt].y = ri;
        checkmax(MX, a[i].r);
    }
    sort(a + 1, a + cnt + 1, cmp);
    pos = a[1].l; now = 0; it = 0;
    while (!q.empty()) q.pop();
    while (1) {
        while (a[now + 1].l <= pos && now + 1 <= cnt) { ++now; q.push(make_pair(-a[now].r, now)); }
        while (!q.empty() && -q.top().first < pos) q.pop();
        ++ it;
        if (it > 250000) break;
        if (q.empty()) continue;
        int i = q.top().second; q.pop();
        ans.emplace_back(make_pair(a[i].x - (pos - a[i].l), a[i].y + (pos - a[i].l)));
        ++pos;
    }
    writeln(ans.size());
    for (auto i : ans) { writes(i.first); writeln(i.second); }
    return 0;
}