Solve in Python:
You are given an n × m rectangular table consisting of lower case English letters. In one operation you can completely remove one column from the table. The remaining parts are combined forming a new table. For example, after removing the second column from the table

abcd

edfg

hijk



 

we obtain the table:

acd

efg

hjk



 

A table is called good if its rows are ordered from top to bottom lexicographically, i.e. each row is lexicographically no larger than the following one. Determine the minimum number of operations of removing a column needed to make a given table good.


-----Input-----

The first line contains two integers  — n and m (1 ≤ n, m ≤ 100).

Next n lines contain m small English letters each — the characters of the table.


-----Output-----

Print a single number — the minimum number of columns that you need to remove in order to make the table good.


-----Examples-----
Input
1 10
codeforces

Output
0

Input
4 4
case
care
test
code

Output
2

Input
5 4
code
forc
esco
defo
rces

Output
4



-----Note-----

In the first sample the table is already good.

In the second sample you may remove the first and third column.

In the third sample you have to remove all the columns (note that the table where all rows are empty is considered good by definition).

Let strings s and t have equal length. Then, s is lexicographically larger than t if they are not equal and the character following the largest common prefix of s and t (the prefix may be empty) in s is alphabetically larger than the corresponding character of t.
import sys
n, m = [int(i) for i in input().split()]
a = [[0] * n for i in range(m)]
for i in range(n):
    temp = input()
    for j in range(m):
        a[j][i] = temp[j]

c = 0

def blatant(a):
    for i in range(1,len(a)):
        if a[i] < a[i-1]:
            return True
    return False

match = []
while True:
    if len(a) == 0:
        print(m)
        return
    elif blatant(a[0]):
        del a[0]
        c += 1
    else:
        break

for i in range(1,n):
    if a[0][i] == a[0][i-1]:
        match.append(i)
        
def rm(a,match):
    c = 0
    for m in match:
        i = 1
        while i < len(a):
            if a[i][m] < a[i][m-1]:
                del a[i]
                c += 1
            elif a[i][m] == a[i][m-1]:
                i += 1
            else:
                break
    return c

while True:
    temp = rm(a,match)
    if temp == 0:
        break
    c += temp
    
print(c)