We have an H-by-W matrix. Let a_{ij} be the element at the i-th row from the top and j-th column from the left. In this matrix, each a_{ij} is a lowercase English letter.

Snuke is creating another H-by-W matrix, A', by freely rearranging the elements in A. Here, he wants to satisfy the following condition:

* Every row and column in A' can be read as a palindrome.



Determine whether he can create a matrix satisfying the condition.

Constraints

* 1 ≤ H, W ≤ 100
* a_{ij} is a lowercase English letter.

Input

Input is given from Standard Input in the following format:


H W
a_{11}a_{12}...a_{1W}
:
a_{H1}a_{H2}...a_{HW}


Output

If Snuke can create a matrix satisfying the condition, print `Yes`; otherwise, print `No`.

Examples

Input

3 4
aabb
aabb
aacc


Output

Yes


Input

2 2
aa
bb


Output

No


Input

5 1
t
w
e
e
t


Output

Yes


Input

2 5
abxba
abyba


Output

No


Input

1 1
z


Output

Yes
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;

class Main
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static Random rnd=new Random();
	static int[] parent,size;
	
	static int find(int u)
	{
		if(parent[u]==u)
		{
			return u;
		}
		
		else
		{
			parent[u]=find(parent[u]);
			
			return parent[u];
		}
	}
	
	static void merge(int u,int v)
	{
		int x=find(u),y=find(v);
		
		if(x!=y)
		{
			parent[y]=x;
			
			size[x]=size[x]+size[y];
			
			size[y]=0;
		}
	}
	
    public static void main(String args[]) throws Exception
    {
		int n=sc.nextInt(),m=sc.nextInt();char[][] a=new char[n][];
		
		int[] cnt=new int[26];
		
		for(int i=0;i<n;i++)
		{
			a[i]=sc.next().toCharArray();
			
			for(int j=0;j<m;j++)
			{
				cnt[a[i][j]-'a']++;
			}
		}
		
		List<Integer> list=new ArrayList<>();
		
		parent=new int[n*m];size=new int[n*m];
		
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				parent[i*m+j]=(i*m)+j;
				
				size[i*m+j]=1;
			}
		}
		
		for(int i=0;i<n;i++)
		{
			for(int j=0,k=m-1;j<k;j++,k--)
			{
				merge(i*m+j,i*m+k);
			}
		}
		
		for(int j=0;j<m;j++)
		{
			for(int i=0,k=n-1;i<k;i++,k--)
			{
				merge(i*m+j,k*m+j);
			}
		}
		
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				if(find(i*m+j)==i*m+j)
				{
					list.add(size[i*m+j]);
				}
			}
		}
		
		Collections.sort(list);boolean ans=true;
		
	//	out.println(list);
		
		for(int i=list.size()-1;i>=0;i--)
		{
			int max=-1,ch=-1;
			
			for(int j=0;j<26;j++)
			{
				if(cnt[j]>max)
				{
					max=cnt[j];ch=j;
				}
			}
			
			if(max>=list.get(i))
			{
				cnt[ch]-=list.get(i);
			}
			else
			{
				ans=false;break;
			}
		}
		
		out.println(ans?"Yes":"No");out.close();
    }
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}