#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 200005;int main()
{int n, cas=0;while(~scanf("%d", &n)){printf("Case #%d: %d\n", ++cas, (int)(log10(2)*n));}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 100000+200, mod = 1e9+7;string s[N];
bool is[27];
int n, mx[27];
ll  num[27][N];
struct Str { string si; int len, id; } str[27];
void Init()
{mes(num,0);  mes(is, 0);
}
bool cmp(Str a, Str b)
{if(a.len!=b.len) return a.len < b.len;for(int j=a.len-1; j>=0; j--) if(a.si[j]!=b.si[j]) {if(a.si[j] < b.si[j]) return true;if(a.si[j] > b.si[j]) return false;}return false;   ////string s1=a.si, s2=b.si;//reverse(s1.begin(),s1.end()), reverse(s2.begin(),s2.end());//return s1<s2;
}
ll  fpow(ll a, int b) {ll ans=1; for(;b;a=a*a%mod, b>>=1)if(b&1)ans=ans*a%mod; return ans; }
int main()
{int cas=0;while(~scanf("%d", &n)){Init();rep(i,1,n) {cin>>s[i];if(s[i].length()!=1) is[s[i][0]-'a']=1;}mes(mx, 0);rep(i,1,n) {int len=s[i].length();for(int j=len-1; j>=0; --j){int ch = s[i][j]-'a';++num[ch][len-j-1];mx[ch] = max(mx[ch], len-j);}}rep(i,0,25) {int len=0;str[i].si="";for(int j=0; j<mx[i]; ++j){num[i][j+1] += num[i][j]/26;num[i][j] %= 26;if(num[i][j+1]) mx[i] = max(mx[i], j+2);str[i].si += ('a'+num[i][j]);}str[i].len=mx[i], str[i].id=i;}sort(str, str+26, cmp);int flag=0;rep(i,0,25) {int ch = str[i].id;if(is[ch]==0) { flag=i; break; }}ll  ans=0;rep(i,0,25) {ll val = flag==i ? 0 : (flag>i ? i+1 : i);for(int j=0; j<str[i].len; ++j) {( ans += val*(str[i].si[j]-'a')*(fpow(26,j)%mod) ) %= mod;}}printf("Case #%d: %lld\n", ++cas, ans);}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 200005;int n, col[N], head[N<<1], tot, Size[N], cnt;
bool vis[N];
ll  sum[N], ans;
struct Edge{int to,next; } e[N<<1];
void Addedge(int u,int v) {e[tot]={v,head[u] }; head[u]=tot++; }
void dfs(int u, int fa)
{Size[u]=1;for(int i=head[u]; i!=-1; i=e[i].next) if(e[i].to!=fa){ll  s=sum[col[u]];dfs(e[i].to, u);Size[u] += Size[e[i].to];ll  num=sum[col[u]]-s, tmp=Size[e[i].to]-num;ans += tmp*(tmp-1)/2, sum[col[u]] += tmp;}++sum[col[u]];
}
void Init()
{mes(head, -1);  mes(sum, 0);  mes(Size, 0);ans = 0, tot = 0;mes(vis, 0);  cnt=0;
}
int main()
{int cas=0;while(~scanf("%d", &n)){Init();rep(i,1,n) {scanf("%d", &col[i]);if(vis[col[i]]==0) vis[col[i]]=1, ++cnt;}int a, b;rep(i,1,n-1) {scanf("%d %d", &a, &b);Addedge(a, b);  Addedge(b, a);}dfs(1, 0);rep(i,1,n) if(vis[i] && i!=col[1]) {ans += 1LL*(n-sum[i])*(n-sum[i]-1)/2;}ans = 1LL*cnt*n*(n-1)/2-ans;printf("Case #%d: %lld\n", ++cas, ans);}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 100005, mod = 1e9+7;bool vis[N];
int mx;
int cal(ll *a, int len, ll *num)
{mes(vis, 0);int sum=0;for(int i=0; i<len; ++i) if(vis[i]==0){++sum;int cnt=0, t=i;while(vis[t]==0){vis[t]=1, ++cnt, t=a[t];}++num[cnt];mx=max(mx, cnt);}return sum;
}
ll  a[N], b[N], num1[N], num2[N];
bool flag1[N];
void Init()
{mes(num1, 0);  mes(num2, 0);  mes(flag1, 0);mx=0;
}
ll fpow(ll a,ll b) {ll ans=1; for(;b;a=a*a%mod, b>>=1)if(b&1)ans=ans*a%mod; return ans; }
int main()
{int cas=0, n, m;while(~scanf("%d %d", &n, &m)){Init();for(int i=0; i<n; ++i) scanf("%lld", &a[i]);for(int i=0; i<m; ++i) scanf("%lld", &b[i]);int cnt1=cal(a, n, num1), cnt2=cal(b, m, num2);ll  ans=1;for(int i=1; i<=mx; ++i) if(num1[i]){ll  res=0;for(int j=i; j>0; --j) if(num2[j] && i%j==0){( res += num2[j]*j%mod ) %= mod;}( ans *= (fpow(res,num1[i]) )) %= mod;}printf("Case #%d: ", ++cas);printf("%lld\n", (ans+mod)%mod);}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef  long long  ll;
const int N = 10000005;unsigned  a[N], A, B, C, ans[110];
int n, m;
bool vis[N];
void Qsort(int ki, int l, int r)
{int i=l, j=r, k=l;while(i<j){for(; i<j; --j) if(a[j]<a[k]){swap(a[j], a[k]);   k=j;break;}for(; i<j; ++i) if(a[i]>a[k]){swap(a[i], a[k]);   k=i;break;}}vis[k] = 1;if(l<k && ki<k) Qsort(ki, l, k-1);if(k<r && k<ki) Qsort(ki, k+1, r);
}
int main()
{int cas=0;while(~scanf("%d %d %lu %lu %lu", &n, &m, &A, &B, &C)){mes(vis, false);unsigned  x = A, y = B, z = C, t;rep(i,1,n){x ^= (x<<16); x ^= (x>>5); x ^= (x<<1);t=x, x=y, y=z, z=t^x^y;a[i] = z;}int bi;rep(i,1,m){scanf("%d", &bi);    ++bi;int l=bi, r=bi;for(; l>0 && vis[l]==0; --l) ;   ++l;for(; r<=n && vis[r]==0; ++r) ;  --r;Qsort(bi, l, r);ans[i] = a[bi];}printf("Case #%d:", ++cas);rep(i,1,m) printf(" %lu", ans[i]);puts("");}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef  long long  ll;
const int N = 10000005;unsigned  a[N], A, B, C, ans[110];
int n, m;
pair<int , int > b[110];
int main()
{int cas=0;while(~scanf("%d %d %lu %lu %lu", &n, &m, &A, &B, &C)){unsigned  x = A, y = B, z = C, t;for(int i=1; i<=n; ++i){x ^= (x<<16); x ^= (x>>5); x ^= (x<<1);t=x, x=y, y=z, z=t^x^y;a[i] = z;}for(int i=1; i<=m; ++i){scanf("%d", &b[i].fi);++b[i].fi,  b[i].se=i;}sort(b+1, b+1+m);b[m+1].fi=n;for(int i=m; i>0; --i){if(i!=m && b[i].fi==b[i+1].fi) {   // 没加这个优化就超时了。。ans[b[i].se] = ans[b[i+1].se];continue;}nth_element(a+1, a+b[i].fi, a+1+b[i+1].fi);ans[b[i].se] = a[b[i].fi];}printf("Case #%d:", ++cas);for(int i=1; i<=m; ++i) printf(" %lu", ans[i]);puts("");}return 0;
}

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 200005;int main()
{int cas=0;ll  n, k;while(~scanf("%lld %lld", &n, &k)){ll  pos;if(k<=n) pos=k;else{k -= n;ll  cnt1=k/(n-1), cnt2=k%(n-1);if(cnt2==0) pos = cnt1&1 ? n-1 : n;else pos=cnt2;}printf("Case #%d: %lld\n", ++cas, pos);}return 0;
}