int main()
{
    int a,b,n;
    cin>>n;

    for(int i=0;i<n;i++){

        cin>>a;
        cin>>b;
        int sum=0;

        for(int j=a;j<=b;j++){
            if(j%2!=0)
                sum+=j;
        }
        cout<<"Case "<<i+1<<": "<<sum<<endl;
    }
    return 0;
}

#include <iostream>
using namespace std;

int main() {
	short int casos = 0, x = 0, y = 0, suma = 0, actual = 0;
	cin >> casos;
	for (int i = 0; i < casos; i++) {
		cin >> x;
		cin >> y;
		for (int j = 0; j <= y-x; j++) {
			actual = x + j;
			if (actual % 2 != 0) {
				suma = suma + actual;
			}
		}
		cout << "Case " << i+1 << ": " << suma << endl;
		suma = 0;
	}
	cout << endl;
	system("pause");
}

Func _Problemita($a, $b)
	Local $result, $i

	For $i = $a To $b
		If Mod($i, 2) <> 0 Then $result += $i
	Next

	Return $result
EndFunc

#include<stdio.h>

int main() {
	int T= 0,a = 0,b= 0,i;
	int rango_a,rango_b;
	scanf("%d\n",&T);
	i = 0;
	while(i < T)	{
		scanf("%d\n",&a);
		scanf("%d\n",&b);
		if(a % 2 != 0)	{
			a-=1;
		}
		rango_a = (((a/2)*a)/2);
		if(b % 2 == 0)	{
			rango_b = (((b/2)*b)/2);
		}
		else	{
			rango_b = ((((b+1)/2)*(b+1))/2);
		}
		printf("Case %i:%i\n",i+1,rango_b-rango_a);
		i++;
	}
	return 0;
}

Func _Problemita2($a, $b)
	Local $result, $i

	If Mod($a, 2) == 0 Then $a += 1

	For $i = $a To $b Step 2
		If Mod($i, 2) <> 0 Then $result += $i
	Next

	Return $result
EndFunc

int main()
{

    int a,b,casos;
    cin>>casos;


    for(int i=0;i<casos;i++){

        cin>>a;
        cin>>b;

        int k_esimaPosicion=(b+1)/2;
        int sumatoriaK=k_esimaPosicion*k_esimaPosicion;

        int imparAnterior=a-2;
        int n_esimPoscion=((imparAnterior)+1)/2;
        int sumatoriaN=n_esimPoscion*n_esimPoscion;

        //sumatoria inclusiva
        int resultado=sumatoriaK-sumatoriaN;

        cout<<resultado<<endl;
    }

    return 0;
}

#include<stdio.h>

int main() {
	int T= 0,a = 0,b= 0,i;
	scanf("%d\n",&T);
	i = 0;
	while(i < T)	{
		scanf("%d\n",&a);
		scanf("%d\n",&b);
		printf("Case %i:%i\n",i+1,(b*b+(b&1)*(b*2+1)-a*a+(a&1)*(a*2-1))>>2);
		i++;
	}
	return 0;
}