#include<iostream>

 #include<cstdio>

 #include<cstring>

 using namespace std;

 const int maxn = +;

 const int INF = 0x3f3f3f3f;

 int n, m, k;

 int g[maxn][maxn];

 int lx[maxn], ly[maxn];

 bool S[maxn], T[maxn];  //记录左右两边节点是否已匹配

 int match[maxn];

 int slack[maxn];   //差值

 bool dfs(int i)

 {

     S[i] = true;

     for (int j = ; j <= m; ++j)

     {

         if (T[j]) continue;   //每一轮匹配，右边节点只能一次

         int gap = lx[i] + ly[j] - g[i][j];

         if (gap == )   //如果符合要求

         {

             T[j] = true;

             if (match[j] == - || dfs( match[j] ))

             {

                 match[j] = i;

                 return true;

             }

         }

         else slack[j] = min(slack[j], gap);

     }

     return false;

 }

 int KM()

 {

     memset(match, -, sizeof match);

     memset(ly, , sizeof ly);   //初始化ly为0

     for (int i = ; i<=n; i++)  //初始化lx[i]为该节点所有边中的最大权值

     {

         lx[i] = g[i][];

         for (int j = ; j<=m; j++)

             lx[i] = max(lx[i], g[i][j]);

     }

     for (int i=; i<=n; i++)    //尝试为每个节点匹配节点

     {

         memset(slack,INF,sizeof(slack));    //因为要取最小值，初始化为无穷大

         while (true) {

             memset(S, false, sizeof S);   //记录每轮匹配中左右节点是否被尝试匹配过

             memset(T, false, sizeof T);

             if (dfs(i)) break;

             int d = INF;

             for (int j=; j<=m; j++)

                 if (!T[j]) d = min(d, slack[j]);

             for (int j=; j<=n; ++j)

                 if (S[j]) lx[j] -= d;

             for(int j=;j<=m;j++)

             {

                 if (T[j]) ly[j] += d;

                 else slack[j] -= d;

             }

         }

     }

     int result = ,flag=;

     for(int i = ; i <=m; i++){

         if(match[i]==-||g[match[i]][i]==-INF)

             continue;

       if(match[i]>-){

         result += g[match[i]][i];

         flag++;

       }

     }

     if(flag<n) result=-;

     return result;

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int cas = ;

     while(~scanf("%d%d%d",&n,&m,&k))

     {

         if(n>m)

         {

             printf("Case %d: %d\n", ++cas, -);

             continue;

         }

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

         for(int j=;j<=m;j++)

             g[i][j] = -INF;

         for(int i=;i<k;i++)

         {

             int u,v,w;

             scanf("%d%d%d",&u,&v,&w);

             u++; v++;

             if(w>=) g[u][v] = w;

         }

         int ans = KM();

         printf("Case %d: %d\n", ++cas, ans);

     }

     return ;

 }