#include
#include
typedef long long LL;
const int NS=10010;
int deg,p,q,a[10],ans;
int b[NS],top;
int cal(int d,int x,int mod)
{
LL t;
int res=0;
for (int i=0;i<=d;i++)
{
t=a[i];
for (int j=0;j=0;i--)
scanf("%d",&a[i]);
scanf("%d",&p);
ans=-1,top=0,q=p*p;
for (int i=0;i=0) break;
}
if (ans>=0) printf("Case #%d: %d
",++cas,ans);
else printf("Case #%d: No solution!
",++cas);
}
return 0;
}