using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;

namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dx = { 0, 1, 0, -1 };
        static readonly int[] dy = { 1, 0, -1, 0 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>>G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
       
        
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);
            var cin = new Scanner();

            var input = cin.SplitRead();
            int H = input[0];
            int W = input[1];

            var type = new int[26];
            Initialize(ref type, 0);
            var c = new PriorityQueue<int>(true);
            for(var i = 0; i < H; i++)
            {
                var a = Console.ReadLine();
                for(var j = 0; j < W; j++)
                {
                    type[a[j] - 'a']++;
                    if (type[a[j] - 'a'] == 4)
                    {
                        c.Enqueue(4);
                        type[a[j] - 'a'] = 0;
                    }
                }
            }
            foreach(var i in type)
            {
                if (i == 3) { c.Enqueue(2);c.Enqueue(1); }
                else if (i != 0) { c.Enqueue(i); }
            }

            

            var need = new List<int>();
            for (var i = 0; i < (H + 1) / 2; i++) 
            {
                for (var j = 0; j < (W + 1) / 2; j++) 
                {
                    int ret = 1;
                    if (W % 2 == 0 || j + 1 < (W + 1) / 2)  { ret *= 2; }
                    if (H % 2 == 0 || i + 1 < (H + 1) / 2)
                    { ret *= 2; }
                    need.Add(ret);
                }
            }


            need.Sort((x, y) => (y - x));
            //Console.WriteLine(string.Join(",", need));
            //while (c.Count() > 0) { Console.Write($"{c.Dequeue()} "); }return;
           
            bool ok = true;
            for(var i = 0; i < need.Count(); i++)
            {
                if (c.Count() == 0) 
                {
                    ok = false;break;
                }
                if (need[i] == 4)
                {
                    if (c.Peek() == 4)
                    {
                        c.Dequeue();
                    }
                    else
                    {
                        ok = false;
                        break;
                    }
                }
                if (need[i] == 2)
                {
                    while (c.Peek() == 4)
                    {
                        c.Dequeue();
                        c.Enqueue(2);c.Enqueue(2);
                    }
                    if (c.Peek() == 1 )  { ok = false;break; }
                    c.Dequeue();
                }
                if (need[i] == 1)
                {
                    if (!c.Contains(1)) { ok = false; break; }
                }

            }

            Console.WriteLine(ok ? "Yes" : "No");
           
            //Console.Out.Flush();
        }
       

        struct Edge
        {
            public int from;

            public int to;
            public long dist;
            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }

        }
        struct Pair<T, U> : IComparable<Pair<T, U>>
        where T : IComparable<T>
        where U : IComparable<U>
        {
            public T first;
            public U second;
            private readonly bool CompWithFirst;

            public Pair(T f, U s, int comp)
            {
                first = f;
                second = s;
                CompWithFirst = comp == 1;
            }
            public Pair(T f,U s)
            {
                first = f;
                second = s;
                CompWithFirst = true;
            }

            public int CompareTo(Pair<T, U> other)
            {
                return CompWithFirst ? first.CompareTo(other.first) : second.CompareTo(other.second);
            }
        }
    }
    public class PriorityQueue<T> where T : IComparable<T>
    {

        private List<T> Q;
        private readonly int r;

        public PriorityQueue(bool ascending)
        {
            if (ascending)
            {
                r = 1;
            }
            else
            {
                r = -1;
            }
            Q = new List<T>();
        }


        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (list[n].CompareTo(list[pIndex]) * r > 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }

        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {

                    comp = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
                }

                if (list[cur].CompareTo(list[comp]) * r < 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }

        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }



        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int Count()
        {
            return Q.Count();
        }

        public bool Contains(T search)
        {
            return Q.Contains(search);
        }
    }
    public class Scanner
    {
        public int[] SplitRead()
        {
            int[] array = Console.ReadLine().Split().Select(int.Parse).ToArray();
            return array;
        }
        public long[] SplitReadL()
        {
            long[] array = Console.ReadLine().Split().Select(long.Parse).ToArray();
            return array;
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = initialvalue;
            }
        }

        static public T MaxLot<T>(params T[] val) where T : IComparable<T>
        {
            T ret = val[0];
            for (var i = 1; i < val.Count(); i++)
            {
                if (ret.CompareTo(val[i]) < 0) { ret = val[i]; }
            }
            return ret;
        }
        static public T MinLot<T>(params T[] val) where T : IComparable<T>
        {
            T ret = val[0];
            for (var i = 1; i < val.Count(); i++)
            {
                if (ret.CompareTo(val[i]) > 0) { ret = val[i]; }
            }
            return ret;
        }
    }

}


Measured memory_bytes: 13492