#include <stdio.h>
#include <vector>

using namespace std;

int main()
{
    long long int n;
    int b,cont=1;

    scanf(" %lld %d ", &n,&b);
    while(n!=0 || b!=0)
    {
        vector<long long int> calls;
        int index;

        calls.push_back(1);
        calls.push_back(1);

        for(int i=2;i<2*b;i++)
        {
            calls.push_back((1+calls[i-1]+calls[i-2])%b);
            if(calls[i-1]==calls[0] && calls[i]==calls[1] && i>=3)
            {
                index = i;
                break;
            }
        }

        printf("Case %d: %lld %d %lld\n",cont,n,b,calls[n%(index-1)]);

        cont++;
        calls.clear();
        scanf(" %lld %d ", &n,&b);
    }

    return 0;
}