n, m = [int(i) for i in input().split()]
k = min(n,m)
print(k+1)
for i in range(k+1):
print(i, k-i)#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <sstream>
#include <numeric>
#include<algorithm>
# define ll long long
using namespace std;
void solve(){
int n, m, temp=0;
cin >> n >> m;
int mx=min(n,m);
cout << mx+1 << "\n";
for(int i=0; i<=mx; i++){
cout << i << " " << mx-i << "\n";
}
}
int main(){
solve();
}1713B - Optimal Reduction | 1710A - Color the Picture |
1686B - Odd Subarrays | 251A - Points on Line |
427C - Checkposts | 1159A - A pile of stones |
508A - Pasha and Pixels | 912A - Tricky Alchemy |
1249A - Yet Another Dividing into Teams | 1713C - Build Permutation |
1699A - The Third Three Number Problem | 1617B - GCD Problem |
841A - Generous Kefa | 1690B - Array Decrements |
1692C - Where's the Bishop | 104A - Blackjack |
1438A - Specific Tastes of Andre | 1711C - Color the Picture |
1194C - From S To T | 110B - Lucky String |
1114A - Got Any Grapes | 224B - Array |
125B - Simple XML | 567B - Berland National Library |
431B - Shower Line | 282C - XOR and OR |
1582B - Luntik and Subsequences | 609A - Флеш-карты |
1207A - There Are Two Types Of Burgers | 371C - Hamburgers |