#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <algorithm>
using namespace std;

int willItFit(int n, int left)
{
	int sum = 0;
	int i;

	for(i = 1; i <= n; i++)
	{
		sum += i;
	}

	if(sum <= left){ return 1; }
	else { return 0; }
}

int main()
{
        int iNum1, iNum2;
	int sum, tempSum;
	int numStep, stepVal;
	int decFlag;
	int temp1, temp2;
	int i;

        while(1)
        {
                cin >> iNum1 >> iNum2;
                if(cin.eof()){ break; }
		sum = iNum2 - iNum1;
		tempSum = 0;
		stepVal = 0;
		decFlag = 0;
		numStep = 0;

		while(tempSum != sum)
		{
			if(decFlag != 1){ stepVal += 1; } 
			else { stepVal = i; }
			
			for(i = stepVal; i > 0; i--)
			{
				if(willItFit(i-1, sum-tempSum-i) == 1){ tempSum += i; numStep++; break; }
				else { decFlag = 1; }
			}
		}

		cout << numStep << endl;
        }

        return 0;
}