#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz");
char s[200][200];
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
ll yoko1[] = {6, 3, 1, 4};
ll tate1[] = {6, 2, 1, 5};
ll yoko2[] = {1, 3, 6, 4};
ll tate2[] = {5, 1, 2, 6};
ll fil[200][200];

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> h >> w;
  rep(i, h) rep(j, w) cin >> s[i][j];
  rep(i, h) {
    rep(j, w) {
      if (i % 2 == 1) continue;
      if ((i / 2) % 2 == 0)
        fil[i][j] = yoko1[j % 4];
      else
        fil[i][j] = yoko2[j % 4];
    }
  }
  rep(i, h) {
    rep(j, w) {
      if (i % 2 == 0) continue;
      if (j % 2 == 1) continue;
      if ((i - 1) / 2 % 2 == 0)
        fil[i][j] = 2;
      else
        fil[i][j] = 5;
    }
  }

  ll min_cost[h + 10][w + 10];
  rep(i, h) rep(j, w) min_cost[i][j] = LINF;
  queue<P> qu;
  qu.push({0LL, 0LL});
  min_cost[0][0] = 0;

  while (!qu.empty()) {
    auto p = qu.front();
    qu.pop();
    rep(i, 4) {
      int nx = p.se + dx[i], ny = p.fi + dy[i];
      if (nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
      if (s[ny][nx] == '#') continue;
      if (min_cost[p.fi][p.se] + 1 >= min_cost[ny][nx]) continue;
      if ((s[ny][nx] - '0') != fil[ny][nx]) continue;
      min_cost[ny][nx] = min_cost[p.fi][p.se] + 1;
      qu.push({ny, nx});
    }
  }
  ans = min_cost[h - 1][w - 1];
  if (ans == LINF)
    Cout("NO");
  else
    Cout("YES");
  return 0;
}


Measured memory_bytes: 3516