#include <bits/stdc++.h>

 #define F(i,a,b) for(int i=a;i<=b;i++)

 using namespace std;

 typedef long long ll;

 ll a[],w[],l,r;

 int t,n,vis[],ic=;

 ll mut(ll a,ll b,ll mod)//高精度求乘法

 {

     ll an=;

     while(b){if(b&)an=(an+a)%mod;b>>=,a=(a<<)%mod;}

     return an;

 }

 ll Extended_Euclid(ll a, ll b, ll &x, ll &y)//扩展欧几里得算法

 {

     if(b==){x=,y=;return a;}

     ll d=Extended_Euclid(b,a%b,y,x);

     y-=a/b*x;

     return d;

 }

 inline ll cal(ll r,ll l,ll m){return (r-l)/m;}

 ll Chinese_Remainder(int len=n+)//中国剩余定理,a[]存放余数,w[]存放两两互质的数

 {

     ll x,y,m,N=,ret=;

     F(i,,len)if(vis[i])N*=w[i];//从1开始

     F(i,,len)if(vis[i])m=N/w[i],Extended_Euclid(w[i],m,x,y),

     ret=(ret+mut(mut(y,m,N),a[i],N))%N;//注意是否爆ll

     ret=(N+ret%N)%N;

     return cal(r+N,ret,N)-cal(l-+N,ret,N);

 }

 int main()

 {

     scanf("%d",&t);

     w[]=,a[]=,vis[]=;

     while(t--)

     {

         scanf("%d%lld%lld",&n,&l,&r);

         F(i,,n+)scanf("%d%d",w+i,a+i);

         F(i,,n+)vis[i]=;

         ll ans=;

         int end=<<n;

         for(int i=;i<end;i++)

         {

             int tp=i,cnt=;

             F(j,,n+)vis[j]=tp&,tp>>=,cnt+=vis[j];

             cnt=cnt&?-:;

             ans+=1ll*cnt*Chinese_Remainder();

         }

         printf("Case #%d: %lld\n",ic++,ans);

     }

     return ;

 }