#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 20;
int val[N][N];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int h, w;
	cin >> h >> w;
	for (int y = 0; y < h; ++y) {
		for (int x = 0; x < w; ++x) cin >> val[y][x];
	}

	ll res = 0;
	for (int mask = 1; mask < (1 << w); ++mask) {
		vector<int> xs, ys;
		for (int x = 0; x < w; ++x) {
			if (mask & (1 << x)) xs.push_back(x);
		}
		for (int y = 0; y < h; ++y) {
			int inc = 1, pre = -1;
			for (int x : xs) {
				if (val[y][x] > pre) pre = val[y][x];
				else inc = 0;
			}
			int dec = 1;
			pre = h*w + 1;
			for (int x : xs) {
				if (val[y][x] < pre) pre = val[y][x];
				else dec = 0;
			}
			if (inc || dec) ys.push_back(y);
		}

		// Loop one row to take
		for (int i = 0; i < ys.size(); ++i) {
			++res;

			// Do DP to count ways to pick other rows
			vector<int> dp(i, 0);
			for (int j = 0; j < i; ++j) {
				dp[j] = 1;
				int cans = (1 << j) - 1;
				for (int x : xs) {
					int v1 = val[ys[j]][x];
					int v2 = val[ys[i]][x];
					for (int t = 0; t < j; ++t) {
						int v0 = val[ys[t]][x];
						if ((v0 < v1) != (v1 < v2)) {
							cans &= ~(1 << t);
						}
					}
				}
				for (int t = 0; t < j; ++t) {
					if (cans & (1 << t)) dp[j] += dp[t];
				}
				res += dp[j];
			}
		}
	}
	
	cout << res << '\n';
}