// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, m;
bool flag;
std::set<int> A, B;
std::vector<std::pair<int, int>> ans;
bool doit(int x, int y)
{
    if (x <= 0 || y <= 0 || x > n || y > m || A.count(x + y) || B.count(x - y))
        return false;
    A.insert(x + y);
    B.insert(x - y);
    ans.push_back({x, y});
    return true;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m;
    if (n > m)
        std::swap(n, m), flag = true;
    for (int i = 1; i <= n; ++i)
        doit(i, 1);
    for (int i = 1; i <= n; ++i)
        doit(i, m);
    for (int i = 1; i <= m; ++i)
    {
        doit(n / 2, i);
        doit(n / 2 + 1, i);
    }
    if (flag)
        for (auto &i : ans)
            std::swap(i.first, i.second);
    std::cout << ans.size() << '\n';
    for (auto i : ans)
        std::cout << i.first << ' ' << i.second << '\n';
    return 0;
}