tjut 5924

#include<stdio.h>  
#include<iostream>  
#include<string.h>  
#include<string>  
#include<ctype.h>  
#include<math.h>  
#include<set>  
#include<map>  
#include<vector>  
#include<queue>  
#include<bitset>  
#include<algorithm>  
#include<time.h>  
using namespace std;  
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }  
#define MS(x,y) memset(x,y,sizeof(x))  
#define ls o<<1  
#define rs o<<1|1  
typedef long long LL;  
typedef unsigned long long UL;  
typedef unsigned int UI;  
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }  
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }  
const int N = 0, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f;  
template <class T1, class T2>inline void gadd(T1 &a, T2 b) { a = (a + b) % Z; }  
int casenum, casei;  
LL l, r;  
int main()  
{  
    scanf("%d", &casenum);  
    for (casei = 1; casei <= casenum; ++casei)  
    {  
        scanf("%lld%lld", &l, &r);  
        printf("Case #%d:\n", casei);  
        if (l == r)  
        {  
            puts("1");  
            printf("%lld %lld\n", l, r);  
        }  
        else  
        {  
            puts("2");  
            printf("%lld %lld\n", l, r);  
            printf("%lld %lld\n", r, l);  
        }  
    }  
    return 0;  
}