A. One-dimensional Japanese Crossword

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized a × b squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integers represents how many groups of black squares there are in corresponding row or column, and the integers themselves represents the number of consecutive black squares in corresponding group (you can find more detailed explanation in Wikipedia ).

Adaltik decided that the general case of japanese crossword is too complicated and drew a row consisting of n squares (e.g. japanese crossword sized 1 × n), which he wants to encrypt in the same way as in japanese crossword.

The example of encrypting of a single row of japanese crossword.

Help Adaltik find the numbers encrypting the row he drew.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100) — the length of the row. The second line of the input contains a single string consisting of n characters 'B' or 'W', ('B' corresponds to black square, 'W' — to white square in the row that Adaltik drew).

Output

The first line should contain a single integer k — the number of integers encrypting the row, e.g. the number of groups of black squares in the row.

The second line should contain k integers, encrypting the row, e.g. corresponding to sizes of groups of consecutive black squares in the order from left to right.

Examples

input

3 BBW

output

1 2

input

5 BWBWB

output

3 1 1 1

input

4 WWWW

output

0

input

4 BBBB

output

1 4

input

13 WBBBBWWBWBBBW

output

3 4 1 3

Note

The last sample case correspond to the picture in the statement.

 题意：输出连续B的个数；

思路：模拟；

#include
           
            using namespace std;#define ll long long#define pi (4*atan(1.0))#define eps 1e-14const int N=1e5+10,M=1e6+10,inf=1e9+10,mod=1e9+7;char a[N];vector
            
             ans;int main(){    int n;    scanf("%d",&n);    scanf("%s",a);    for(int i=0;i
            
           

B. Passwords

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya is managed to enter his favourite site Codehorses. Vanya uses n distinct passwords for sites at all, however he can't remember which one exactly he specified during Codehorses registration.

Vanya will enter passwords in order of non-decreasing their lengths, and he will enter passwords of same length in arbitrary order. Just when Vanya will have entered the correct password, he is immediately authorized on the site. Vanya will not enter any password twice.

Entering any passwords takes one second for Vanya. But if Vanya will enter wrong password k times, then he is able to make the next try only 5 seconds after that. Vanya makes each try immediately, that is, at each moment when Vanya is able to enter password, he is doing that.

Determine how many seconds will Vanya need to enter Codehorses in the best case for him (if he spends minimum possible number of second) and in the worst case (if he spends maximum possible amount of seconds).

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 100) — the number of Vanya's passwords and the number of failed tries, after which the access to the site is blocked for 5 seconds.

The next n lines contains passwords, one per line — pairwise distinct non-empty strings consisting of latin letters and digits. Each password length does not exceed 100 characters.

The last line of the input contains the Vanya's Codehorses password. It is guaranteed that the Vanya's Codehorses password is equal to some of his n passwords.

Output

Print two integers — time (in seconds), Vanya needs to be authorized to Codehorses in the best case for him and in the worst case respectively.

Examples

input

5 2 cba abc bb1 abC ABC abc

output

1 15

input

4 100 11 22 1 2 22

output

3 4

Note

Consider the first sample case. As soon as all passwords have the same length, Vanya can enter the right password at the first try as well as at the last try. If he enters it at the first try, he spends exactly 1 second. Thus in the best case the answer is 1. If, at the other hand, he enters it at the last try, he enters another 4 passwords before. He spends 2 seconds to enter first 2 passwords, then he waits 5seconds as soon as he made 2 wrong tries. Then he spends 2 more seconds to enter 2 wrong passwords, again waits 5 seconds and, finally, enters the correct password spending 1 more second. In summary in the worst case he is able to be authorized in 15 seconds.

Consider the second sample case. There is no way of entering passwords and get the access to the site blocked. As soon as the required password has length of 2, Vanya enters all passwords of length 1 anyway, spending 2 seconds for that. Then, in the best case, he immediately enters the correct password and the answer for the best case is 3, but in the worst case he enters wrong password of length 2 and only then the right one, spending 4 seconds at all.

 

 题意：给你一个n个字符串，从长度小的到大的输入，每k次会等待五秒，求最坏和最好的情况；

 思路：模拟；

#include
         
          using namespace std;#define ll long long#define pi (4*atan(1.0))#define eps 1e-14const int N=1e5+10,M=1e6+10,inf=1e9+10,mod=1e9+7;char ch[110][110];char pass[N];int main(){    int n,m;    scanf("%d%d",&n,&m);    for(int i=1;i<=n;i++)    scanf("%s",&ch[i]);    int flag=0,k=0;    scanf("%s",pass);    for(int i=1;i<=n;i++)    {        if(strlen(ch[i])
          
           strlen(pass))        k++;    }    n=n-k+1;    int ans=0;    while(n)    {        ans+=min(n,m);        n-=min(n,m);        if(n==0)        break;        ans+=5;    }    printf("%d %d\n",flag+1+(flag/m)*5,ans);    return 0;}
          
         

C. Journey

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in a way such that there are nocyclic routes between showplaces.

Initially Irina stands at the showplace 1, and the endpoint of her journey is the showplace n. Naturally, Irina wants to visit as much showplaces as she can during her journey. However, Irina's stay in Berlatov is limited and she can't be there for more than T time units.

Help Irina determine how many showplaces she may visit during her journey from showplace 1 to showplace n within a time not exceeding T. It is guaranteed that there is at least one route from showplace 1 to showplace n such that Irina will spend no more than Ttime units passing it.

Input

The first line of the input contains three integers n, m and T (2 ≤ n ≤ 5000,  1 ≤ m ≤ 5000,  1 ≤ T ≤ 109) — the number of showplaces, the number of roads between them and the time of Irina's stay in Berlatov respectively.

The next m lines describes roads in Berlatov. i-th of them contains 3 integers ui, vi, ti (1 ≤ ui, vi ≤ n, ui ≠ vi, 1 ≤ ti ≤ 109), meaning that there is a road starting from showplace ui and leading to showplace vi, and Irina spends ti time units to pass it. It is guaranteed that the roads do not form cyclic routes.

It is guaranteed, that there is at most one road between each pair of showplaces.

Output

Print the single integer k (2 ≤ k ≤ n) — the maximum number of showplaces that Irina can visit during her journey from showplace 1 to showplace n within time not exceeding T, in the first line.

Print k distinct integers in the second line — indices of showplaces that Irina will visit on her route, in the order of encountering them.

If there are multiple answers, print any of them.

Examples

input

4 3 13 1 2 5 2 3 7 2 4 8

output

3 1 2 4

input

6 6 7 1 2 2 1 3 3 3 6 3 2 4 2 4 6 2 6 5 1

output

4 1 2 4 6

input

5 5 6 1 3 3 3 5 3 1 2 2 2 4 3 4 5 2

output

3 1 3 5

 

题意：给你一个图，n个点，m条边，总时间T；求在T时间内能走过最多的点从1-n；

思路：拓扑dp；dp[i][j]表示从1-i经过j个点花费的时间；

　　　坑点：有无关的点；

#include
         
          using namespace std;#define ll long long#define pi (4*atan(1.0))const int N=2e5+10,M=4e6+10,inf=1e9+10,mod=1e9+7;const ll INF=1e18+10;int dp[5005][5005];int du[N];struct is{    int v,w;    int next;}edge1[N],edge2[N] ;int jiedge1,jiedge2;int head1[N],head2[N];int flag[N];int n,m,T;void init(){    memset(du,0,sizeof(du));    memset(head1,0,sizeof(head1));    memset(head2,0,sizeof(head2));    memset(flag,0,sizeof(flag));    jiedge1=0;    jiedge2=0;}void add1(int u,int v,int w){    ++jiedge1;    edge1[jiedge1].v=v;    edge1[jiedge1].w=w;    edge1[jiedge1].next=head1[u];    head1[u]=jiedge1;}void add2(int u,int v,int w){    ++jiedge2;    edge2[jiedge2].v=v;    edge2[jiedge2].w=w;    edge2[jiedge2].next=head2[u];    head2[u]=jiedge2;}void bfs(int u){    queue
          
           q;    q.push(u);    dp[1][1]=0;    while(!q.empty())    {        int u=q.front();        q.pop();        for(int i=head1[u];i;i=edge1[i].next)        {            int v=edge1[i].v;            int w=edge1[i].w;            for(int t=1;t<=n;t++)            {                if(dp[u][t-1]+w<=T)                {                    dp[v][t]=min(dp[v][t],dp[u][t-1]+w);                }            }            if(--du[v]==0&&!flag[v])q.push(v);        }    }}int ans[N];void getans(int u,int x){    printf("%d\n",x);    int flag=x;    while(u!=1)    {        for(int i=head2[u];i;i=edge2[i].next)        {            int v=edge2[i].v;            int w=edge2[i].w;            if(w+dp[v][x-1]==dp[u][x])            {                ans[x]=v;                x--;                u=v;                break;            }        }    }    for(int i=2;i<=flag;i++)    printf("%d ",ans[i]);    printf("%d\n",n);}int main(){    scanf("%d%d%d",&n,&m,&T);    for(int i=0;i
           

q; for(int i=2;i<=n;i++) if(du[i]==0) q.push(i),flag[i]=1; while(!q.empty()) { int u=q.front(); q.pop(); for(int i=head1[u];i;i=edge1[i].next) { int v=edge1[i].v; du[v]--; if(du[v]==0&&v!=1) q.push(v),flag[v]=1; } } bfs(1); for(int i=n;i>=0;i--) if(dp[n][i]