【Codeforces Round】 #142 (Div. 2) C. Shifts（模拟）

You are given a table consisting of n rows and m columns. Each cell of the table contains a number, 0 or 1. In one move we can choose some row of the table and cyclically shift its values either one cell to the left, or one cell to the right.

To cyclically shift a table row one cell to the right means to move the value of each cell, except for the last one, to the right neighboring cell, and to move the value of the last cell to the first cell. A cyclical shift of a row to the left is performed similarly, but in the other direction. For example, if we cyclically shift a row "00110" one cell to the right, we get a row "00011", but if we shift a row "00110" one cell to the left, we get a row "01100".

Determine the minimum number of moves needed to make some table column consist only of numbers 1.

Input

The first line contains two space-separated integers: n (1 ≤ n ≤ 100) — the number of rows in the table and m (1 ≤ m ≤ 104) — the number of columns in the table. Then n lines follow, each of them contains m characters "0" or "1": the j-th character of the i-th line describes the contents of the cell in the i-th row and in the j-th column of the table.

It is guaranteed that the description of the table contains no other characters besides "0" and "1".

Output

Print a single number: the minimum number of moves needed to get only numbers 1 in some column of the table. If this is impossible, print -1.

Examples

Input

3 6
101010
000100
100000

Output

3

Input

2 3
111
000

Output

-1

Note

In the first sample one way to achieve the goal with the least number of moves is as follows: cyclically shift the second row to the right once, then shift the third row to the left twice. Then the table column before the last one will contain only 1s.

In the second sample one can't shift the rows to get a column containing only 1s.

题目大意：给你一个N*M的矩阵，其中矩阵中每一个格子都包含一个数（0或1），我们可以循环移动一行，就是当做一个圈那样循环，问你要用最少的移动次数将这个矩阵的某一列弄成全都是1的情况

思路（模拟）：这个题目我们可以用模拟的方法把每一行的到某一列的步数算出来最后算出来就行了，

就是基本上弄成这个样子

代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=10010;
int sum[maxn],pos[maxn];
int n,m;
char a[maxn];
int main()
{
    scanf("%d%d",&n,&m);
    bool flag=0;
    for(int i=0;i<n;i++)
    {
        cin>>a;
        int num=1;
        for(int j=0;j<m;j++)
        {
            if(a[j]=='1')
                pos[num++]=j;
        }
        if(num==1)
        {
            flag=1;break;
        }
        pos[0]=pos[num-1]-m;
        pos[num]=pos[1]+m;
        int r,l,ans=0;
        for(int j=0;j<m;j++)
        {
            l=j-pos[ans];
            r=pos[ans+1]-j;
            if(r==0)
                ans++;
            sum[j]+=min(l,r);
        }
    }

    int minn=100000000;
    if(flag)
        cout<<"-1"<<endl;
    else
    {
        for(int i=0;i<m;i++)
        {
            if(minn>sum[i])
                minn=sum[i];
        }
        cout<<minn<<endl;
    }
}