#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define pi acos(-1)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=,inf=;

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    int n,m;

    while(cin>>n>>m,n&&m){

        int k=m-n,t=k*(+sqrt())/;

        if(n==t)cout<<<<endl;

        else

        {

            cout<<<<endl;

            if(t<n)cout<<t<<" "<<m-n+t<<endl;//取两个相同数的情况

            for(int i=;;i++)//i是间隔

            {

                int t=i*(+sqrt())/;

                if(t>=m)break;

                if(n==t&&m-i>n)cout<<n<<" "<<n+i<<endl;//从m中取，取完m比n大

                else if(n-i==t)cout<<t<<" "<<t+i<<endl;//从m中取，取完m比n小

                else if(m==t+i&&n>t)cout<<t<<" "<<t+i<<endl;//从n中取

            }

        }

    }

    return ;

}