/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxl=4e4+300;
const ull hash1=123;
int m;
char s[maxl];
ull H[maxl];
ull xp[maxl];
ull gethash(int i,int L){return H[i]-H[i+L]*xp[L];
}
int len;
map<ull,vector<int> > mp;
map<ull,int> cont;
map<ull,vector<int> >::iterator it;
ull val[maxl];
bool check(int l){for(int i=0;i<len-l+1;i++){val[i]=gethash(i,l);}sort(val,val+len-l+1);int c=0;for(int i=0;i<len-l+1;i++){if(i==0||val[i]!=val[i-1]) c=1;if(val[i]==val[i-1]) c++;if(c>=m) return true;}return false;
}
void getans(int l){mp.clear();for(int i=0;i+l<=len;i++){mp[gethash(i,l)].pb(i);}
}
void init(){xp[0]=1;for(int i=1;i<maxl;i++){xp[i]=xp[i-1]*hash1;}
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);init();while(cin>>m,m){scanf("%s",s);len=strlen(s);H[len]=0;for(int i=len-1;i>=0;i--){H[i]=H[i+1]*hash1+(ull)s[i];}int l=0,r=len+1;while(r-l>1){int mid=(r+l)/2;if(check(mid)){l=mid;}else{r=mid;}}if(l==0){puts("none");continue;}getans(l);vector<int> pos;for(it=mp.begin();it!=mp.end();it++){if(it->se.size()>=m){sort(it->se.begin(),it->se.end());pos.pb(it->se.bk);}}sort(pos.begin(),pos.end());printf("%d %d\n",l,pos.bk);}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=1005;
int N,T,S,E;
int mp[maxn][maxn];
int dis[maxn][maxn];
int tmp[maxn][maxn];
int v[maxn];
int num=0;
void setINF(int a[][maxn]){for(int i=0;i<num;i++){for(int j=0;j<num;j++){a[v[i]][v[j]]=INF;}}
}
void cp(int a[][maxn],int b[][maxn]){for(int i=0;i<num;i++){for(int j=0;j<num;j++){a[v[i]][v[j]]=b[v[i]][v[j]];}}
}
void floyd(int dis[][maxn],int a[][maxn],int b[][maxn]){for(int k=0;k<num;k++){for(int i=0;i<num;i++){for(int j=0;j<num;j++){if(dis[v[i]][v[j]]>a[v[i]][v[k]]+b[v[k]][v[j]]){dis[v[i]][v[j]]=a[v[i]][v[k]]+b[v[k]][v[j]];}}}}
}
void solve(){while(N){if(N&1){setINF(tmp);floyd(tmp,dis,mp);cp(dis,tmp);}setINF(tmp);floyd(tmp,mp,mp);cp(mp,tmp);N>>=1;}
}
bool used[maxn];
int main(){freopen("/home/files/CppFiles/in","r",stdin);cin>>N>>T>>S>>E;for(int i=0;i<maxn;i++){for(int j=0;j<maxn;j++){mp[i][j]=INF;}}for(int i=0;i<T;i++){int a,b,l;scanf("%d%d%d",&l,&a,&b);if(!used[a])v[num++]=a,used[a]=1;if(!used[b])v[num++]=b,used[b]=1;if(mp[a][b]>l){mp[a][b]=l;mp[b][a]=l;}}setINF(dis);for(int i=0;i<num;i++) dis[v[i]][v[i]]=0;solve();printf("%d\n",dis[S][E]);return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
*/
#include <bits/stdc++.h>
#define pb push_back
#define se second
#define fs first
#define sq(x) (x)*(x)
#define eps 0.000000001
#define LB lower_bound
#define IINF (1<<29)
#define LINF (1ll<<59)
#define bk back()
#define PB pop_back
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;const int maxl=1e5+3000;
char s[3][maxl];
int len[3];
int f[3][maxl];
void getFail(char *p,int *f){int m=strlen(p);f[0]=-1;f[1]=0;for(int i=1;i<m;i++){int j=f[i];while(j&&p[i]!=p[j]) j=f[j];f[i+1]=(p[i]==p[j]?j+1:0);}
}
int getmax(int x,int y){int i=0,j=0;while(i<len[x]&&j<len[y]){if(j==-1||s[x][i]==s[y][j]){i++,j++;}else{j=f[y][j];}}return j;
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("test.in","r",stdin);//freopen("test.out","w",stdout);for(int i=0;i<3;i++){scanf("%s",s[i]);len[i]=strlen(s[i]);}for(int i=0;i<3;i++) getFail(s[i],f[i]);int ans=0;for(int i=0;i<3;i++){for(int j=0;j<3;j++){if(i==j) continue;for(int k=0;k<3;k++){if(i==k||j==k) continue;int tmp=getmax(i,j);if(tmp==len[j]){tmp+=getmax(i,k);}else{tmp+=getmax(j,k);}ans=max(ans,tmp);}}}cout<<len[0]+len[1]+len[2]-ans<<endl;return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
*/
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxe=6e5+300;
const int maxn=1e5+300;
struct EDGE{int to;bool d;
}es[maxe];
bool del[maxe];
int deg[maxn];
int eh=0;
int ans[maxe];
vector<int> G[maxn];
int T;
int n,m;
void init(){eh=0;for(int i=0;i<=n;i++){G[i].clear();}memset(ans,0,sizeof ans);memset(del,0,sizeof del);memset(deg,0,sizeof deg);
}
void addedge(int from,int to){es[eh].to=to;es[eh].d=1;G[from].pb(eh++);es[eh].to=from;es[eh].d=0; G[to].pb(eh++);deg[from]++,deg[to]++;
}
set<int> d1;
void dfs(int v){while(!G[v].empty()&&del[G[v].bk]) G[v].PB();deg[v]--;del[G[v].bk]=del[G[v].bk^1]=1;ans[G[v].bk/2]=es[G[v].bk].d;int to=es[G[v].bk].to;deg[to]--;if(deg[to]%2==0){d1.erase(to);return;}dfs(to);
}
void eular(int v){while(!G[v].empty()&&del[G[v].bk]) G[v].PB();if(G[v].empty()) return;deg[v]--;EDGE e=es[G[v].bk];del[G[v].bk]=del[G[v].bk^1]=1;ans[G[v].bk/2]=e.d;deg[e.to]--;G[v].PB();eular(e.to);
}
void solve(){d1.clear();for(int i=1;i<=n;i++){if(deg[i]%2) d1.insert(i);}while(d1.size()){int v=*d1.begin();d1.erase(v);dfs(v);}for(int i=1;i<=n;i++){if(deg[i]){eular(i);}}
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n>>m;init();for(int i=0;i<m;i++){int u,v;scanf("%d%d",&u,&v);addedge(u,v);}solve();for(int i=0;i<m;i++){printf("%d\n",ans[i]);}}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2e5+3000;
bool del[maxn];
int es[maxn];
int eh=0;
vector<int> G[maxn];
void addedge(int from,int to){es[eh]=to;G[from].pb(eh++);es[eh]=from;G[to].pb(eh++);
}
int T,n,m;
int low[maxn],dfn[maxn],clo,rmax[maxn],smax[maxn],maxid[maxn];
void tarjan_dfs(int v){dfn[v]=low[v]=++clo;for(int i=0;i<G[v].size();i++){int e=G[v][i];if(del[e]) continue;int u=es[e];del[e^1]=1;if(!dfn[u]){tarjan_dfs(u);low[v]=min(low[v],low[u]);if(max(u,rmax[u])>rmax[v]){smax[v]=max(u,rmax[u]);swap(smax[v],rmax[v]);maxid[v]=u;}else if(max(u,rmax[u])>smax[v]){smax[v]=max(u,rmax[u]);}}else{low[v]=min(low[v],dfn[u]);}}
}
int ans[maxn][2];
bool vis[maxn];
void work(int v,int from,int f){vis[v]=1;for(int i=0;i<G[v].size();i++){int e=G[v][i];if(del[e]||vis[es[e]]) continue;int u=es[e];if(u==maxid[v]){if(max(v,smax[v])>smax[u]){smax[u]=max(v,smax[v]);}}else{if(max(v,rmax[v])>smax[u]){smax[u]=max(v,rmax[v]);}}work(u,e,v);}if(f!=-1&&low[v]==dfn[v]){if(max(v,rmax[v])==n){ans[from/2][0]=max(f,smax[f]);ans[from/2][1]=max(f,smax[f])+1;}else{ans[from/2][0]=max(v,rmax[v]);ans[from/2][1]=max(v,rmax[v])+1;}}
}
void init(){clo=eh=0;memset(del,0,sizeof del);memset(dfn,0,sizeof dfn);memset(ans,0,sizeof ans);memset(smax,0,sizeof smax);memset(rmax,0,sizeof rmax);memset(vis,0,sizeof vis);for(int i=0;i<=n;i++)G[i].clear();
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n>>m;init();for(int i=0;i<m;i++){int a,b;scanf("%d%d",&a,&b);addedge(a,b);}tarjan_dfs(1);work(1,0,-1);for(int i=0;i<m;i++){printf("%d %d\n",ans[i][0],ans[i][1]);}}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2e4+300;
int T;
int n;
vector<int> G[maxn];
int ansv,ansn;
int num1[maxn];
void init(){for(int i=0;i<=n;i++){G[i].clear();}ansn=1e9;
}
void dfs(int v,int f){num1[v]=1;int maxx=0;for(int i=0;i<G[v].size();i++){int u=G[v][i];if(u==f) continue;dfs(u,v);num1[v]+=num1[u];maxx=max(maxx,num1[u]);}maxx=max(maxx,n-num1[v]);if(maxx<ansn){ansn=maxx;ansv=v;}else if(maxx==ansn){ansv=v;}
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n;init();for(int i=0;i<n-1;i++){int a,b;scanf("%d%d",&a,&b);G[a].pb(b);G[b].pb(a);}dfs(1,-1);printf("%d %d\n",ansv,ansn);}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2e4+300;
struct EDGE{int to,d;
};
vector<int> G[maxn];
EDGE es[maxn];
int eh;
int center,mins;
bool vis[maxn];
vector<int> dis;
int n,k;
int cnt;
int getCenter(int v,int f){int ssum=0,maxs=0;for(int i=0;i<G[v].size();i++){int e=G[v][i];int u=es[e].to;if(vis[u]||u==f) continue;int aa=getCenter(u,v);if(aa>maxs) maxs=aa;ssum+=aa;}if(max(maxs,cnt-ssum-1)<mins){center=v;mins=max(maxs,cnt-ssum-1);}return ssum+1;
}
void dfs(int v,int fore,int f){dis.pb(fore);for(int i=0;i<G[v].size();i++){int e=G[v][i];int u=es[e].to;if(vis[u]||u==f) continue;dfs(u,fore+es[e].d,v);}
}
void cont(int v,int f){cnt++;for(int i=0;i<G[v].size();i++){int e=G[v][i];int u=es[e].to;if(vis[u]||u==f) continue;cont(u,v);}
}
int cul(int v,int fore){int ans=0;dis.clear();dfs(v,fore,-1);sort(dis.begin(),dis.end());int p=0,q=dis.size()-1;while(p<=q){while(p<=q&&dis[q]+dis[p]>k) q--;if(p>q) break;ans+=q-p;p++;}return ans;
}
int solve(int v){vis[v]=1;int ans=0;ans+=cul(v,0);for(int i=0;i<G[v].size();i++){int e=G[v][i];int u=es[e].to;if(vis[u]) continue;ans-=cul(u,es[e].d);mins=1e8;cnt=0;cont(u,-1);getCenter(u,-1);ans+=solve(center);}return ans;
}
void addedge(int from,int to,int d){es[eh].to=to,es[eh].d=d;G[from].pb(eh++);es[eh].to=from,es[eh].d=d;G[to].pb(eh++);
}
void init(){eh=0;for(int i=0;i<=n;i++)G[i].clear();memset(vis,0,sizeof vis);dis.clear();
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);while(cin>>n>>k){if(n==0&&k==0) break;init();for(int i=0;i<n-1;i++){int a,b,c;scanf("%d%d%d",&a,&b,&c);addedge(a,b,c);}mins=1e9;dfs(1,0,-1);cnt=0;cont(1,-1);getCenter(1,-1);cout<<solve(center)<<endl;}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=205;
int T;
int n;
int a[maxn];
int dp[maxn][maxn][maxn];
vector<int> num,col;
int cal(int l,int r,int k){if(l==r) return sq(num[l]+k);if(dp[l][r][k]!=-1) return dp[l][r][k];dp[l][r][k]=0;dp[l][r][k]=max(dp[l][r][k],cal(l,r-1,0)+sq(num[r]+k));for(int p=l;p<r-1;p++){if(col[p]==col[r]&&r-1>=p+1)dp[l][r][k]=max(dp[l][r][k],cal(l,p,num[r]+k)+cal(p+1,r-1,0));}return dp[l][r][k];
}
int cas=0;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n;memset(dp,-1,sizeof dp);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}num.clear();col.clear();int last=-1,cont=0;for(int i=1;i<=n;i++){if(a[i]!=last){if(last!=-1){num.pb(cont);col.pb(last);}cont=1;last=a[i];}else{cont++;}}col.pb(last);num.pb(cont);int len=col.size();printf("Case %d: %d\n",++cas,cal(0,len-1,0));}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=205;
int T;
int n;
int a[maxn];
int dp[maxn][maxn][maxn];
vector<int> num,col;
int cal(int l,int r,int k){if(l==r) return sq(num[l]+k);if(dp[l][r][k]!=-1) return dp[l][r][k];dp[l][r][k]=0;dp[l][r][k]=max(dp[l][r][k],cal(l,r-1,0)+sq(num[r]+k));for(int p=r-2;p>=l;p--){if(col[p]==col[r]&&r-1>=p+1){int res=cal(l,p,num[r]+k)+cal(p+1,r-1,0);if(dp[l][r][k]<res){dp[l][r][k]=res;break;//神剪枝！！。。
            }}}return dp[l][r][k];
}
int cas=0;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n;memset(dp,-1,sizeof dp);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}num.clear();col.clear();int last=-1,cont=0;for(int i=1;i<=n;i++){if(a[i]!=last){if(last!=-1){num.pb(cont);col.pb(last);}cont=1;last=a[i];}else{cont++;}}col.pb(last);num.pb(cont);int len=col.size();printf("Case %d: %d\n",++cas,cal(0,len-1,0));}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;
int T;
double dp[60][10040];
vector<int> G[60];
int n,m,d;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n>>m>>d;for(int i=0;i<=n;i++) G[i].clear();for(int i=0;i<m;i++){int a,b;scanf("%d%d",&a,&b);G[a].pb(b);G[b].pb(a);}for(int del=1;del<=n;del++){memset(dp,0,sizeof dp);for(int i=1;i<=n;i++) dp[i][0]=1.0/n;for(int s=0;s<d;s++){for(int i=1;i<=n;i++){if(i==del) continue;for(int j=0;j<G[i].size();j++){if(G[i][j]==del) continue;int u=G[i][j];dp[u][s+1]+=dp[i][s]/G[i].size();}}}double ans=0;for(int i=1;i<=n;i++){if(i==del) continue;ans+=dp[i][d];}printf("%.10f\n",ans);}}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const ll hashsize=2e6;
int n,m;
int M[30][30];
int ex,ey;
int bit[30];
int hashTab[hashsize];
int Snum[2];
ll dp[2][hashsize],ans;
int state[2][hashsize];
bool idx;
void hashCal(ll s,ll num){int hashpos=s%hashsize;while(hashTab[hashpos]!=-1){if(state[idx][hashTab[hashpos]]==s){dp[idx][hashTab[hashpos]]+=num;return;}hashpos++;if(hashpos==hashsize) hashpos=0;}hashTab[hashpos]=Snum[idx]++;state[idx][hashTab[hashpos]]=s;dp[idx][hashTab[hashpos]]=num;
}
void plug_dp(){for(int i=1;i<=n;i++){for(int k=0;k<Snum[idx];k++) state[idx][k]<<=2;for(int j=1;j<=m;j++){idx^=1;Snum[idx]=0;memset(hashTab,-1,sizeof hashTab);for(int k=0;k<Snum[1^idx];k++){int s=state[1^idx][k];int p=(s>>bit[j-1])%4;int q=(s>>bit[j])%4;ll num=dp[idx^1][k];if(!M[i][j]){if(!p&&!q){hashCal(s,num);}}else if(!p&&!q){if(M[i+1][j]&&M[i][j+1]){s+=(1<<bit[j-1])+(2<<bit[j]);hashCal(s,num);}}else if(!p&&q){if(M[i][j+1]) hashCal(s,num);if(M[i+1][j]){s+=(q<<bit[j-1])-(q<<bit[j]);hashCal(s,num);}}else if(p&&!q){if(M[i+1][j]) hashCal(s,num);if(M[i][j+1]){s+=(p<<bit[j])-(p<<bit[j-1]);hashCal(s,num);}}else if(p+q==2){int b=1;for(int t=j+1;t<=m;t++){int v=(s>>bit[t])%4;if(v==1) b++;if(v==2) b--;if(b==0){s-=(1<<bit[t]);break;}}s-=(1<<bit[j-1])+(1<<bit[j]);hashCal(s,num);}else if(p+q==4){int b=1;for(int t=j-2;t>=0;t--){int v=(s>>bit[t])%4;if(v==2) b++;else if(v==1) b--;if(b==0){s+=(1<<bit[t]);break;}}s-=(2<<bit[j-1])+(2<<bit[j]);hashCal(s,num);}else if(p==2&&q==1){s-=(2<<bit[j-1])+(1<<bit[j]);hashCal(s,num);}else if(p==1&&q==2){if(i==ex&&j==ey){ans+=num;}}}}}
}
void init(){for(int i=0;i<=15;i++)bit[i]=i<<1;dp[0][0]=1;Snum[0]=1;
}
void read(){char r[30];cin>>n>>m;for(int i=1;i<=n;i++){scanf("%s",r);for(int j=1;j<=m;j++){if(r[j-1]=='*'){M[i][j]=0;}else{M[i][j]=1;ex=i,ey=j;}}}
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);
    init();read();plug_dp();cout<<ans<<endl;return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-3)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=1005;
struct EDGE{int to,d;EDGE(int to,int d):to(to),d(d){}
};
struct A{int v,has,cost;bool operator < (const A &C)const{return cost>C.cost;}A(int v,int has,int cost):v(v),has(has),cost(cost){}
};
vector<EDGE> G[maxn];
priority_queue<A> Q;
int n,m;
int cost[maxn][105];
int p[maxn];
int c,s,e;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>n>>m;for(int i=0;i<n;i++){scanf("%d",&p[i]);}for(int i=0;i<m;i++){int a,b,c;scanf("%d%d%d",&a,&b,&c);G[a].pb(EDGE(b,c));G[b].pb(EDGE(a,c));}int q;cin>>q;while(q--){int cont=0;while(!Q.empty()) Q.pop();scanf("%d%d%d",&c,&s,&e);memset(cost,0x3f,sizeof cost);cost[s][0]=0;Q.push(A(s,0,0));bool f=0;int ans;while(!Q.empty()){cont++;A now=Q.top();Q.pop();int v=now.v,t=now.has;if(v==e) break;if(cost[v][t]<now.cost) continue;if(t+1<=c){if(cost[v][t+1]>cost[v][t]+p[v]){cost[v][t+1]=cost[v][t]+p[v];Q.push(A(v,t+1,cost[v][t]+p[v]));}}for(int i=0;i<G[v].size();i++){EDGE &e=G[v][i];if(t>=e.d){if(cost[e.to][t-e.d]>cost[v][t]){cost[e.to][t-e.d]=cost[v][t];Q.push(A(e.to,t-e.d,cost[e.to][t-e.d]));}}}}if(cost[e][0]<1e8)printf("%d\n",cost[e][0]);else puts("impossible");}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps 0.00000001
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF 1000000000
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2e5+300;
int n;
vector<int> G[maxn];
int dis[maxn];
vector<int> D;
bool mark[maxn];
void bfs(int s){memset(dis,-1,sizeof dis);queue<int> Q;dis[s]=0;Q.push(s);while(!Q.empty()){int v=Q.front();Q.pop();for(int i=0;i<G[v].size();i++){int u=G[v][i];if(dis[u]==-1){dis[u]=dis[v]+1;Q.push(u);}}}
}
void getD(int v,int maxp){D.clear();while(1){D.pb(v);if(v==maxp) break;for(int i=0;i<G[v].size();i++){int u=G[v][i];if(dis[u]+1==dis[v]){v=u;break;}}}
}
bool vis[maxn];
void bfs_mark(int v,int rem){queue<P> Q;Q.push(P(v,rem));while(!Q.empty()){int u=Q.front().fs;int r=Q.front().se;mark[u]=1,vis[u]=1;Q.pop();for(int i=0;i<G[u].size();i++){int uu=G[u][i];if(!vis[uu]){if(r>0)Q.push(P(uu,r-1));}}}
}
int ans[2];
bool check(int p){if(p>=D.size()-1){ans[0]=1;ans[1]=2;return 1;}ans[0]=D[p];ans[1]=D[D.size()-1-p];if(ans[1]==ans[0]){ans[1]=D[p-1];}memset(mark,0,sizeof mark);memset(vis,0,sizeof vis);bfs_mark(ans[0],p);memset(vis,0,sizeof vis);bfs_mark(ans[1],p);for(int i=1;i<=n;i++){if(!mark[i]) return 0;}return 1;
}
int T;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){cin>>n;for(int i=0;i<=n;i++)G[i].clear();for(int i=0;i<n-1;i++){int a,b;scanf("%d%d",&a,&b);G[a].pb(b);G[b].pb(a);}if(n==2){puts("0 1 2");continue;}bfs(1);int maxd=0,maxp=0;for(int i=1;i<=n;i++){if(dis[i]>maxd){maxd=dis[i];maxp=i;}}bfs(maxp);maxd=0;int maxs=0;for(int i=1;i<=n;i++){if(dis[i]>maxd){maxd=dis[i];maxs=i;}}getD(maxs,maxp);int l=0,r=n-1;while(r-l>1){int mid=(r+l)/2;if(check(mid)){r=mid;}else{l=mid;}}check(r);printf("%d %d %d\n",r,ans[0],ans[1]);}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-6)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=1<<10;
int n;
double p[maxn][maxn];
double dp[30][maxn];
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);while(cin>>n){if(n==-1) break;int num=(1<<n);for(int i=0;i<num;i++){for(int j=0;j<num;j++){scanf("%lf",&p[i][j]);}}memset(dp,0,sizeof dp);for(int i=0;i<num;i++) dp[0][i]=1;for(int k=1;k<=n;k++){int rd=1<<k;for(int i=0;i<num;i++){for(int j=i/rd*rd;j<i/rd*rd+rd;j++){if(j/(rd/2)==i/(rd/2)) continue;dp[k][i]+=dp[k-1][i]*dp[k-1][j]*p[i][j];}}}double maxx=0;int ans=0;for(int i=0;i<num;i++){if(dp[n][i]>maxx){maxx=dp[n][i];ans=i;}}cout<<ans+1<<endl;}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-6)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;int n,m;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);while(cin>>n>>m){double ans=1;for(int i=1;i<=m;i++){ans*=((double)(n-1)/n);}ans=1-ans;printf("%.14f",ans*n);}return 0;
}

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-19)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;int T;
int n,k[3],h[3];
int tol;
double A[600],B[600];
void dfs(int v){//cout<<v<<endl;if(A[v]>0) return;if(v>n) return;for(int i=1;i<=k[0];i++){for(int j=1;j<=k[1];j++){for(int m=1;m<=k[2];m++){dfs(v+i+j+m);if(i==h[0]&&j==h[1]&&m==h[2]) continue;A[v]+=A[v+i+j+m]/tol;B[v]+=B[v+i+j+m]/tol;}}}A[v]+=1.0/tol;B[v]+=1;
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);cin>>T;while(T--){tol=1;cin>>n;memset(A,0,sizeof A);memset(B,0,sizeof B);for(int i=0;i<3;i++){scanf("%d",&k[i]);tol*=k[i];}for(int i=0;i<3;i++){scanf("%d",&h[i]);}dfs(0);printf("%.15f\n",B[0]/(1-A[0]));}return 0;
}

/*
* @author:  Cwind
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-9)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2005;
int N,M,K;
double p1,p2,p3,p4;
double dp[2][maxn];
double c[maxn];
double pp[maxn];
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("defense.in","r",stdin);//freopen("defense.out","w",stdout);while(scanf("%d%d%d%lf%lf%lf%lf",&N,&M,&K,&p1,&p2,&p3,&p4)!=EOF){if(p4<eps){puts("0.00000");continue;}memset(dp,0,sizeof dp);memset(c,0,sizeof c);memset(pp,0,sizeof pp);bool f=0;double p=p2/(1-p1);double p33=p3/(1-p1);double p44=p4/(1-p1);dp[f][1]=p44/(1-p);c[1]=p44;pp[0]=1.0;for(int i=1;i<=N;i++) pp[i]=p*pp[i-1];for(int i=2;i<=N;i++){for(int j=2;j<=K;j++) c[j]=p33*dp[f][j-1]+p44;for(int j=K+1;j<=i;j++) c[j]=p33*dp[f][j-1];double tmp=c[1]*pp[i-1];for(int j=2;j<=K;j++) tmp+=c[j]*pp[i-j];for(int j=K+1;j<=i;j++) tmp+=c[j]*pp[i-j];dp[f^1][i]=tmp/(1-pp[i]);dp[f^1][1]=p44+dp[f^1][i]*p;for(int j=2;j<i;j++){dp[f^1][j]=c[j]+dp[f^1][j-1]*p;}f^=1;}printf("%.5f\n",dp[f][M]);}return 0;
}

/*
* @author:  Cwind
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-6)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxlen=1e5+30000;
char r[maxlen];
char min1[maxlen],min2[maxlen];
char tmp[maxlen];
char rev[maxlen];
int fail[maxlen];
void getNext(char *s,int *fail,int len){int i=0,j=fail[0]=-1;while(i<len){while(j!=-1&&s[i]!=s[j]) j=fail[j];fail[++i]=++j;}
}int MinimumRepresentation2(char *s,int len){    int i=0,j=1,k=0;while(i<len&&j<len&&k<len){int tag=s[(j+k)%len]-s[(i+k)%len];if(tag==0){k++;continue;}if(tag<0)j+=k+1;elsei+=k+1;if(i==j) j++;k=0;}return min(i,j);
}int T;
int n;
int main(){
freopen("/home/files/CppFiles/in","r",stdin);//freopen("test.in","r",stdin);//freopen("test.out","w",stdout);cin>>T;while(T--){cin>>n;scanf("%s",r);strcpy(rev,r);int len=n;for(int i=0;i<n-i-1;i++){swap(rev[i],rev[n-i-1]);}for(int i=len;i<len*2;i++){rev[i]=rev[i-len];}rev[len*2]=0;int p1=MinimumRepresentation2(r,len);for(int i=0;i<len;i++){min1[i]=r[(i+p1)%len];}min1[len]=0;int p2=MinimumRepresentation2(rev,len);for(int i=0;i<len;i++){min2[i]=rev[(i+p2)%len];}min2[len]=0;getNext(min2,fail,len);int i=0,j=0;int last=0;while(i<len*2-1){if(j==-1||min2[j]==rev[i]) i++,j++;else j=fail[j];if(j==len){last=i-len;}}int d=strcmp(min1,min2);if(d>0){printf("%d 0\n",p1+1);}else if(d<0){printf("%d 1\n",len-last);}else{if(p1+1<=len-last){printf("%d 0\n",p1+1);}else{printf("%d 1\n",len-last);}}}return 0;
}

/*
* @author:  Cwind
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-6)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxlen=520;
const int maxn=70;
int T,n,l,s;
vector<int> G[maxn];
double dp[maxn][maxlen];
double tmp[maxlen];
double tmp2[maxlen];
double prob;
void dfs(int v,int f){if(f!=-1&&G[v].size()==1){dp[v][0]=1;return;}dp[v][0]=-1;for(int i=0;i<G[v].size();i++){int u=G[v][i];if(u==f) continue;dfs(u,v);memset(tmp,0,sizeof tmp);for(int j=0;j<=s;j++){for(int a=0;a<=l;a++){if(j+a<=s){tmp[j+a]+=prob*dp[u][j];}}}if(dp[v][0]==-1){for(int j=0;j<=s;j++){dp[v][j]=tmp[j];}}else{memset(tmp2,0,sizeof tmp2);for(int j=0;j<=s;j++){for(int k=0;k<=s;k++){if(k+j>s) break;tmp2[max(k,j)]+=dp[v][j]*tmp[k];}}for(int j=0;j<=s;j++){dp[v][j]=tmp2[j];}}}
}
void init(){for(int i=0;i<=n;i++){G[i].clear();}
}
int cas=0;
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("test.in","r",stdin);//freopen("test.out","w",stdout);cin>>T;while(T--){cin>>n>>l>>s;init();memset(dp,0,sizeof dp);for(int i=0;i<n-1;i++){int a,b;scanf("%d%d",&a,&b);G[a].pb(b);G[b].pb(a);}prob=1.0/(l+1);dfs(1,-1);double ans=0;for(int i=0;i<=s;i++){ans+=dp[1][i];}printf("Case %d: %.6f\n",++cas,ans);}return 0;
}

/*
* @author:  Cwind
*/
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-6)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define INF (1000000000)
#define FINF (1e3)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;const int maxn=2e5;
int n,k;
vector<int> G[maxn];
int a[maxn];
int tmp[305];
int dfs(int v){int dp[305];memset(dp,-1,sizeof dp);dp[0]=0;for(int i=0;i<G[v].size();i++){int u=G[v][i];int num=dfs(u);for(int x=k;x>=0;x--){for(int j=1;j<=num;j++){if(j+x<=k&&dp[x]!=-1&&tmp[j]!=-1){dp[j+x]=max(dp[j+x],dp[x]+tmp[j]);}}}}dp[1]=max(dp[1],a[v]);for(int i=0;i<=k;i++){tmp[i]=dp[i];}for(int i=0;i<=k;i++){if(dp[i]==-1){return i;}}
}
void init(){for(int i=0;i<=n;i++){G[i].clear();}
}
int main(){freopen("/home/files/CppFiles/in","r",stdin);//freopen("test.in","r",stdin);//freopen("test.out","w",stdout);while(cin>>n>>k){init();for(int i=1;i<=n;i++){int x;scanf("%d%d",&x,&a[i]);G[x].pb(i);}dfs(0);if(tmp[k]==-1){puts("impossible");}else{printf("%d\n",tmp[k]);}}return 0;
}