Problem: You are given n k-digit integers. You have to rearrange the digits in the integers so that the difference between the largest and the smallest number was minimum. Digits should be rearranged by the same rule in all integers.

Input

The first line contains integers n and k — the number and digit capacity of numbers correspondingly (1 ≤ n, k ≤ 8). Next n lines contain k-digit positive integers. Leading zeroes are allowed both in the initial integers and the integers resulting from the rearranging of digits.

Output

Print a single number: the minimally possible difference between the largest and the smallest number after the digits are rearranged in all integers by the same rule.

Examples

Input

6 4
5237
2753
7523
5723
5327
2537


Output

2700


Input

3 3
010
909
012


Output

3


Input

7 5
50808
36603
37198
44911
29994
42543
50156


Output

20522

Note

In the first sample, if we rearrange the digits in numbers as (3,1,4,2), then the 2-nd and the 4-th numbers will equal 5237 and 2537 correspondingly (they will be maximum and minimum for such order of digits).

In the second sample, if we swap the second digits and the first ones, we get integers 100, 99 and 102.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, k, ans = INT_MAX, bk[105], mk[105];
string a[105], b[105];
int trans(string x) {
  stringstream xx;
  xx << x;
  int re;
  xx >> re;
  return re;
}
void dfs(int cur) {
  if (cur == k) {
    int re1 = 0, re2 = INT_MAX;
    for (int i = 1; i <= n; i++) b[i].clear();
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < k; j++) b[i].push_back(a[i][mk[j]]);
    for (int i = 1; i <= n; i++)
      re1 = max(re1, trans(b[i])), re2 = min(re2, trans(b[i]));
    ans = min(ans, re1 - re2);
  } else {
    for (int i = 0; i < k; i++)
      if (!bk[i]) {
        bk[i] = 1;
        mk[cur] = i;
        dfs(cur + 1);
        bk[i] = 0;
      }
  }
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  dfs(0);
  cout << ans << "\n";
}