#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll F[256];
string s; 
ll solve(int x) {
	if(x == 0) return 0;
	int id = upper_bound(F, F+92, x) - F - 1;
	return F[id-1] + solve(x - F[id]);
	
}
int main() {
	cin>>s;
	cin>>n;
	F[1] = 1;
	for(int i=2;i<=92;i++) F[i] = F[i-1] + F[i-2];
	// for(int i=0;i<=92;i++) cout<<F[i]<<endl;
	for(int i=1;i<=n;i++) {
		int l, r;
		cin>>l>>r;
		if(l == 0) l = 1;
		cout<<solve(r) - solve(l-1)<<endl;
	}
	return 0;
}