#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using loop = int;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(loop (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(loop (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(loop (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(loop (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
//#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

int main() {
    init();

    int yd[] = { 6,2,1,5 }, xd[] = { 6,3,1,4 };
    int yd2[] = { 6,5,1,2 }, xd2[] = { 6,4,1,3 };

    int h, w; cin >> h >> w;
    vector<string> s(h); cin >> s;
    vector<VI> g(h * w);

    for (int y = 0; y < h; y += 2) {
        FOR(x, 0, w - 1) {
            bool ok = false;
            FOR(j, 0, 4) {
                if ((y / 2) % 2 == 0) {
                    ok |= (s[y][x] - '0' == xd[j] && s[y][x + 1] - '0' == xd[(j + 1) % 4]);
                }
                else {
                    ok |= (s[y][x] - '0' == xd2[j] && s[y][x + 1] - '0' == xd2[(j + 1) % 4]);
                }
            }
            if (ok) {
                g[y * w + x].push_back(y * w + x + 1);
                g[y * w + x + 1].push_back(y * w + x);
            }
        }
    }
    for (int x = 0; x < w; x += 2) {
        FOR(y, 0, h - 1) {
            bool ok = false;
            FOR(j, 0, 4) {
                if ((x / 2) % 2 == 0) {
                    ok |= (s[y][x] - '0' == yd[j] && s[y + 1][x] - '0' == yd[(j + 1) % 4]);
                }
                else {
                    ok |= (s[y][x] - '0' == yd2[j] && s[y + 1][x] - '0' == yd2[(j + 1) % 4]);
                }
            }
            if (ok) {
                g[y * w + x].push_back((y + 1) * w + x);
                g[(y + 1) * w + x].push_back(y * w + x);
            }
        }
    }

    auto vis = vec<bool>(h * w);
    vis[0] = true;
    queue<int> bfs;
    bfs.push(0);
    while (!bfs.empty()) {
        int now = bfs.front();
        bfs.pop();
        each(to, g[now]) {
            if (vis[to])continue;
            vis[to] = true;
            bfs.push(to);
        }
    }

    cout << (vis[h * w - 1] ? "YES" : "NO") << "\n";
}


Measured memory_bytes: 3384