#include <bits/stdc++.h>
// #include "ane.cpp"

const int INF  = 1e9;
const long long INFLL = 1e18;
const int NMAX = 105;
const int MMAX = 105;
const int KMAX = 1005;
const int MOD  = 1e9 + 7;
using namespace std;

// comment to disable debug functions
// #define DEBUG

// frequently used macros

#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v,x) find(v.begin(), v.end(), (x))
#endif

#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#ifdef DEBUG
#define DUMP(x) do{ std::cerr << (#x) << ": " << x << std::endl; }while(0)
#else
#define DUMP(x) do{}while(0)
#endif

// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;

// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};

// frequently used structs
struct edge{
  int to,cost;
};

// printf for debug
#ifndef DEBUG
void debug(const char* format, ...){}
#else
void debug(const char* format, ...){
  va_list arg;
  va_start(arg, format);
  vprintf(format, arg);
  va_end(arg);
}
#endif

// dump vector
#ifdef DEBUG
#define DUMPV(v, c) do{       \
  printf("%s: ", #v);         \
  for (int i = 0; i < (c); ++i) \
  {                           \
  cout << (v)[i] << " ";      \
  }                           \
  cout << endl;               \
} while(0)
#else
#define DUMPV(v,c)
#endif

// std::fill of multi dimensions
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
  std::fill( (T*)array, (T*)(array+N), val );
}

// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(int)){
  ll mid;
  while(_end - _begin > 1LL) {
  mid = (_begin + _end) / 2LL;
  if(f(mid)) {
    debug("BSearch: f(%d) == true\n", mid);
    _end = mid;
  }
  else
  {
    debug("BSearch: f(%d) == false\n", mid);
    _begin = mid;
  }
  }
  return _end;
}


ll N,M,K,A,B,C,D,E;
char dat[NMAX][MMAX] = {};
int cnt[26] = {};
int sum4 = 0, sum2 = 0, sumodd = 0;
string S;
vec v;

bool ans = {};

bool solve(){
  // main algorithm
  // count
  for (int i = 0; i < N ; ++i)
  {
    for (int j = 0; j < M ; ++j)
    {
      ++cnt[dat[i][j] - 'a'];
    }
  }
  bool foundodd = false;
  for (int i = 0; i < 26; ++i)
  {
    if (cnt[i] % 2 == 0)
    {
      sum4 += (cnt[i] / 4) * 4;
      sum2 += cnt[i] % 4;
    }else{
      if (foundodd)
      {
        return false;
      }
      foundodd = true;
      if((cnt[i] - 1) % 4 == 0) {
        sum4 += cnt[i] - 1;
      }
      else {
        sum2 += cnt[i] - 1;
      }
    }
  }
  DUMP(sum4);
  DUMP(sum2);
  DUMP(foundodd);

  if(N % 2 == 0 && M % 2 == 0){
    return (sum2 == 0 && !foundodd);
  }else if(N % 2 == 1 && M % 2 == 1){
    return (foundodd && sum2 <= N + M - 2);
  }else{
    int od = (N % 2 == 1 ? N : M);
    int ev = (N % 2 == 1 ? M : N);
    return (!foundodd && sum2 <= ev);
  }
}
void debug(){
  // output debug information
  // debug("dat:\n");
  // for (int i = 0; i < N; ++i)
  // {
  //   for (int j = 0; j < M; ++j)
  //   {
  //     cout << dat[i][j];
  //   }
  //   cout << endl;
  // }
}
void answer(){
  // output answer
  if(ans) {
    cout << "Yes\n";
  }
  else {
    cout << "No\n";
  }
}
int main(int argc, char const *argv[])
{
  // operate inputs

  // Fill(dp, -1);
  cin >> N >> M;
  for (int i = 0; i < N ; ++i)
  {
    for (int j = 0; j < M ; ++j)
    {
      scanf(" %c", &dat[i][j]);
    }
  }
  ans = solve();
  #ifdef DEBUG
  debug();
  #endif
  answer();

  return 0;
}

Measured memory_bytes: 256