ACM Q11461

import java.util.Scanner;
import java.lang.Math.*;
public class Q11461 {
  public static void main(String args[]) {
    Scanner cin = new Scanner(System.in);
    while(cin.hasNextInt()){
      int M = cin.nextInt();
      int N = cin.nextInt();
      if((M==0)&&(N==0))
        break;
      int L = (int) Math.ceil(Math.sqrt(Math.min(M,N)));
      int U = (int) Math.floor(Math.sqrt(Math.max(M,N)));
      System.out.println(U-L+1);
    }
  }
}