Problem:
Problem H: Fibonacci Sets

Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).

Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, each node i having a Fibonacci label F[i] = (f(i) mod N) assigned for i = 1,..., V ≤ N. If |F(i) - F(j)| < d, then the nodes i and j are connected.

Given V and d, how many connected subsets of nodes will you obtain?

Figure 1: There are 4 connected subsets for V = 20 and d = 100.

Input

Each data set is defined as one line with two integers as follows:

Line 1: Number of nodes V and the distance d.

Input includes several data sets (i.e., several lines). The number of dat sets is less than or equal to 50.

Constraints

1 ≤ V ≤ 1000

1 ≤ d ≤ 150

Output

Output line contains one integer - the number of connected subsets - for each input line.

Sample Input

5 5
50 1
13 13

Output for the Sample Input

2
50
8

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;


public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(sc.hasNext()){
			final int V = sc.nextInt();
			final int D = sc.nextInt();
			
			if(V == 0 && D == 0){
				break;
			}
			
			int fibs[] = new int[V+1];
			
			fibs[0] = 1;
			fibs[1] = 2;
			for(int i = 2; i <= V; i++){
				fibs[i] = fibs[i-1] + fibs[i-2];
			}
			
			for(int i = 1; i <= V; i++){
				fibs[i] %= 1001;
			}
			
			Arrays.sort(fibs);
			
			int count = 0;
			
			for(int i = 1; i <= V; i ++){
				if(fibs[i-1] + D <= fibs[i] || (i != V && (fibs[i+1] - D >= fibs[i]))){
					count++;
				}
			}
			
			
			System.out.println(count);
			
		}
	}

}