Opponents

# 问题描述 小白有 n 个对手，他每天都要和这些对手PK。对于每一天，如果 n 个对手全部到齐，那么小白就输了一场，否则小白就赢了一场。特别的，如果某天一个对手都没有到，也算小白赢。现在已知对手 d 天的出场情况，请计算小白最多能连胜多少场。 # 输入输出格式 ## 输入格式 第一行，两个整数 n , d ( 1 ≤ n,d ≤ 100 )。接下来 d 行，每行 n 个 0 或 1 的整数，依次表示这一天所有对手的到场情况， 1 表示到场， 0 表示缺席。 ## 输出格式 一个整数，表示最多的连胜场次。

Arya has $ n $ opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya. For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents. Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.

The first line of the input contains two integers $ n $ and $ d $ ( $ 1<=n,d<=100 $ ) — the number of opponents and the number of days, respectively. The $ i $ -th of the following $ d $ lines contains a string of length $ n $ consisting of characters '0' and '1'. The $ j $ -th character of this string is '0' if the $ j $ -th opponent is going to be absent on the $ i $ -th day.

Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.

2 2
10
00

2

4 1
0100

1

4 5
1101
1111
0110
1011
1111

2

In the first and the second samples, Arya will beat all present opponents each of the $ d $ days. In the third sample, Arya will beat his opponents on days $ 1 $ , $ 3 $ and $ 4 $ and his opponents will beat him on days $ 2 $ and $ 5 $ . Thus, the maximum number of consecutive winning days is $ 2 $ , which happens on days $ 3 $ and $ 4 $ .