#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main()
{
    int ti, ret = 0;
    cin >> ti;
    while (ti--)
    {
        printf("case #%d:\n", ret++);
        string a, b;
        int f, num;
        cin >> a >> num;
        if (a[0] == '-')
        {
            a.erase(a.begin());
            cout << "-";//符号判断
        }
        if (a.find('.') == -1)
        {
            a = a + '.';
        }
        a = '0' + a;            //奇怪的步骤,但可以防止999变2位精度时不能得到1.0F3,留空给进位用
        int head = a.find('.'); //原本的小数点位在head-1处
        int temphead = head;
        string::iterator it = a.begin();
        while (temphead--)
        {
            it++;
        }
        a.erase(it); //除去小数点;
        a = a + "00000000000000000000000000000000000000000000000000000000000000000000000000000";
        int prezero = 0;
        for (int i = 0; a[i] != '\0'; i++)
        {
            if (a[i] == '0')
            {
                prezero++;
                continue;
            }
            break;
        }
        // cout << "test data::prezero ->" << prezero << endl; //实际上都多了1位
        int res = 1;
        // cout << "The number we determine add---" << a[prezero + num] << endl;//判断是否该进位
        // cout << "first:" << a << endl;
        if (a[prezero + num] >= '5')
            for (int i = prezero + num - 1; i >= prezero - 1; i--)
            {
                if (a[i] == '9' & res == 1)
                {
                    a[i] = '0';
                    res = 1;
                    continue;
                }
                a[i] = a[i] + res;
                res = 0;
            } //精确度操作
        // cout << "lasto:" << a;//测试精度转换成功否?
        int prezero2 = 0; //重新统计0
        for (int i = 0; a[i] != '\0'; i++)
        {
            if (a[i] == '0')
            {
                prezero2++;
                continue;
            }
            break;
        }

        int tail = head - prezero2 - 1;//尾数
        // cout<<tail<<endl;
        for (int i = prezero2; i < prezero2 + num; i++)
        {
            cout << a[i];
            if (i == prezero2)
                cout << ".";
        }
        if (tail != 0)
            cout << "F" << tail;//为零就不输出
            cout<<endl;
    }
}
//我的博客主页在https://www.cnblogs.com/emokable/
//思路:对真分数和假分数一起判断,前置0用于进位,用string容器的find()找出'.'的位置
//用了两次前置0,第一次用来定位判断进位,第二次则是找到输出位置(因为进位后前置0变化)