// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979;
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return ~n & 1; }
template<typename T> int len(const T &v) { return v.size(); }
template<typename T = int> T in() { T x; cin >> x; return x; }
template<typename T = int> T in(T &&x) { T z(forward<T>(x)); cin >> z; return z; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &x : v) is >> x; return is; }
template<typename A, typename B> istream &operator>>(istream &is, pair<A, B> &p) { return is >> p.first >> p.second; }
template<typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : "\n"); return os; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : " "); return os; }
template<typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << ' ' << p.second; }
template<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }
template<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }
// clang-format on

using Weight = int;
struct Edge {
  int src, dst;
  Weight weight;
  Edge(const int &s = 0, const int &d = 0, const Weight &w = 0) : src(s), dst(d), weight(w) {}
};

using Edges = vector<Edge>;

class Graph {
  vector<Edges> g;
  using iterator = vector<Edges>::iterator;
  using const_iterator = vector<Edges>::const_iterator;

public:
  Graph(const int &size = 0) : g(size) {}
  size_t size() const { return g.size(); }
  const Edges &operator[](const int &i) const { return g[i]; }
  Edges &operator[](const int &i) { return g[i]; }
  void addArc(const int &src, const int &dst, const Weight &w = 1) { g[src].emplace_back(src, dst, w); }
  void addEdge(const int &node1, const int &node2, const Weight &w = 1) {
    addArc(node1, node2, w);
    addArc(node2, node1, w);
  }
  iterator begin() { return g.begin(); }
  const_iterator begin() const { return g.begin(); }
  iterator end() { return g.end(); }
  const_iterator end() const { return g.end(); }
};

class Dijkstra {
  int src;
  Graph g;
  vector<Weight> dist;
  vector<int> prev;

public:
  Dijkstra(const Graph &g, const int &src, const Weight inf = numeric_limits<Weight>::max() / 8) //
      : g(g), src(src), dist(g.size(), inf), prev(g.size()) {
    using state = pair<Weight, int>;
    priority_queue<state, vector<state>, greater<state>> q;
    dist[src] = 0;
    q.emplace(0, src);
    while (q.size()) {
      Weight d;
      int v;
      tie(d, v) = q.top();
      q.pop();
      if (dist[v] < d) continue;
      for (auto &e : g[v]) {
        if (cmin(dist[e.dst], dist[v] + e.weight)) {
          prev[e.dst] = v;
          q.emplace(dist[e.dst], e.dst);
        }
      }
    }
  }

  Weight shortestDist(const int &v) { return dist[v]; }

  vector<int> shortestPath(int v) {
    vector<int> p;
    while (v != src) {
      p.emplace_back(v);
      v = prev[v];
    }
    p.emplace_back(src);
    reverse(all(p));
    return p;
  }

  Graph shortestPathDAG(const int &destination) {
    Graph rg(g.size());
    for (auto &es : g) {
      for (auto &e : es) rg.addArc(e.dst, e.src, e.weight);
    }
    Dijkstra rdij(rg, destination);
    Graph dag(g.size());
    Weight st = shortestDist(destination);
    for (auto &es : g) {
      for (auto &e : es) {
        Weight su = shortestDist(e.src), uv = e.weight, vt = rdij.shortestDist(e.dst);
        if (su + uv + vt == st) dag.addArc(e.src, e.dst, e.weight);
      }
    }
    return dag;
  }
};

vector<int> topSort(const Graph &g) {
  int n = g.size(), k = 0;
  vector<int> ord, in(n);
  ord.reserve(n);
  for (auto &es : g) {
    for (auto &e : es) in[e.dst]++;
  }
  queue<int> q;
  rep(i, n) if (in[i] == 0) q.emplace(i);
  while (q.size()) {
    int v = q.front();
    q.pop();
    ord.emplace_back(v);
    for (auto &e : g[v])
      if (--in[e.dst] == 0) q.emplace(e.dst);
  }
  return ord.size() == n ? ord : vector<int>();
}

int main() {
  int R, C;
  cin >> R >> C;
  Graph g(R * C);
  rep(i, R) rep(j, C) {
    if (i > 0) g.addEdge((i - 1) * C + j, i * C + j);
    if (j > 0) g.addEdge(i * C + (j - 1), i * C + j);
  }
  rep(i, R) rep(j, C) {
    g.addArc(i * C + j, 0 * C + j);
    g.addArc(i * C + j, i * C + 0);
    g.addArc(i * C + j, (R - 1) * C + j);
    g.addArc(i * C + j, i * C + (C - 1));
  }
  int ai, aj, bi, bj;
  cin >> ai >> aj >> bi >> bj;
  Dijkstra dij(g, ai * C + aj);
  Graph dag = dij.shortestPathDAG(bi * C + bj);
  vector<int> ts = topSort(dag);
  vector<int> cnt(R * C);
  cnt[ai * C + aj] = 1;
  rep(i, R * C) {
    for (auto &e : dag[ts[i]]) (cnt[e.dst] += cnt[e.src]) %= MOD;
  }
  cout << dij.shortestDist(bi * C + bj) << " " << cnt[bi * C + bj] << endl;
}



Measured memory_bytes: 109132