/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
     
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
     
/** Read */
     
static const int buf_size = 4096;
     
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
     
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
     
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
     
/** Write */
     
static int write_pos = 0;
static char write_buf[buf_size];
     
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
     
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
     
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
     
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
     
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;   
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228   


int n, m;
int cnt[26];


int main() {    
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char c;
            cin >> c;
            cnt[c - 'a']++;
        }
    }
    int g = 0;
    int k = 0;
    int t = 0;
    int heh = 0;
    int ks = 0;
    int ks1 = 0;
    for (int i = 0; i < 26; i++) {
        if (cnt[i] % 2 == 1) {
            g++;
        }
        if (cnt[i] % 4 == 0) {
            k++;
        } else {
            if (cnt[i]) {
                t++;
                if (cnt[i] % 4 == 1) {
                    heh++;
                } else if (cnt[i] % 4 == 2) {
                    ks++;
                } else {
                    ks1++;
                }
            }
        }
    }
    if ((n % 2 == 0 || m % 2 == 0) && g) {
        cout << "No\n";
        return 0;
    }        
    if (g > 1) {
        cout << "No\n";
        return 0;
    }
    if (n % 2 == 1 && m % 2 == 1) {
        if (!g) {
            cout << "No\n";
            return 0;
        }
    }
    if (n == 1 || m == 1) {
        cout << "Yes\n";
        return 0;
    }
    if (n % 2 == 0 && m % 2 == 0) {
        if (t) {
            cout << "No\n";
        } else {
            cout << "Yes\n";
        }
        return 0;
    }
    if (n % 2 == 1 && m % 2 == 1) {
        if (heh || ks1) {
            if (heh + ks1 == 1) {
                if (ks + ks1 <= (n + m) / 2) {
                    cout << "Yes\n";
                    return 0;
                }
            }
        }
        cout << "No\n";
    } else {
        if (n % 2 == 0 && m % 2 == 0) {
            if (t == 0) {
                cout << "Yes\n";
            } else {
                cout << "No\n";
            }
        } else {
           // cout << "opa" << endl;
            int kek = 0;
            int keks = 0;
            for (int i = 0; i < 26; i++) {
                cnt[i] %= 4;
                if (cnt[i] == 2) {
                    kek++;
                } else {
                    if (cnt[i] == 1) {
                        keks++;
                    }
                }
            }
            if (n % 2 == 1) {
                if (keks == 0 && kek <= m / 2) {
                    cout << "Yes\n";
                } else {
                    cout << "No\n";
                }
            } else {
                if (keks == 0 && kek <= n / 2) {
                    cout << "Yes\n";
                } else {
                    cout << "No\n";
                }
            }
        }
    }
    return 0;
}


Measured memory_bytes: 256