#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint H, W; cin >> H >> W;
    unordered_map<char, lint> count;
    range(i, 0, H) range(j, 0, W) {
        char c; cin >> c;
        count[c] += 1;
    }
    lint num_4 = 0, num_2 = 0, num_1 = 0;
    for (const auto& p : count) {
        char c; lint cnt;
        tie(c, cnt) = p;
        if (cnt >= 4) {
            num_4 += cnt / 4;
            cnt %= 4;
        }
        if (cnt >= 2) {
            num_2 += cnt / 2;
            cnt %= 2;
        }
        if (cnt >= 1) {
            num_1 += 1;
        }
    }
    bool is_feasible;
    if (H % 2 == 0 and W % 2 == 0) {
        is_feasible = (num_2 == 0) and (num_1 == 0);
    } else if (H % 2 == 0) {
        is_feasible = (num_2 <= (H / 2)) and (num_1 == 0);
    } else if (W % 2 == 0) {
        is_feasible = (num_2 <= (W / 2)) and (num_1 == 0);
    } else {
        is_feasible = (num_2 <= (H - 1) / 2 + (W - 1) / 2) and (num_1 == 1);
    }
    cout << (is_feasible ? "Yes" : "No") << "\n";
}

Measured memory_bytes: 256