#include<bits/stdc++.h>
//#define MOD ((int)1e9 + 7)
#define MOD ((int)100000007)
#define MAX ((int)2e9)

using namespace std;

typedef long long LL;


int solve(int cur, int rem)
{
    if(rem < 0) return 0;
    if(cur > last)
    {
        if(rem == 0) return 1;
        else return 0;
    }
    int ans = 0;
    /// case 0:
    ans += solve(cur + 1, rem);
    /// case 1:
    ans += solve(cur, rem - val[cur]);
    return dpp[cur][rem] = ans % MOD;
}

int dpp[102][10002];

void solve(int caseNo){
    dpp[n+1][0] = 1;

    for(int rem = 1 ; rem <= K ; rem++) dpp[n+1][rem] = 0;

    for(int cur = n ; cur > 0 ; cur--)
    {
        for(int rem = 0 ; rem <= K ; rem++)
        {
            int ans = 0;
            /// case 0:
//            ans += solve(cur + 1, rem);
            ans += dpp[cur+1][rem]
            /// case 1:
//            ans += solve(cur, rem - val[cur]);
            if(rem - val[cur] >= 0) ans += dpp[cur][rem - val[cur]];
            dpp[cur][rem] = ans % MOD;
        }
    }

    cout<<"Case "<<caseNo<<": "<<dpp[1][K]<<endl;
}

int main()
{

    /// problem: https://lightoj.com/problem/coin-change-ii
}