Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:

  * 'U': go up, (x, y)  →  (x, y+1); 
  * 'D': go down, (x, y)  →  (x, y-1); 
  * 'L': go left, (x, y)  →  (x-1, y); 
  * 'R': go right, (x, y)  →  (x+1, y). 



The robot will do the operations in s from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (a, b).

Input

The first line contains two integers a and b, ( - 109 ≤ a, b ≤ 109). The second line contains a string s (1 ≤ |s| ≤ 100, s only contains characters 'U', 'D', 'L', 'R') — the command.

Output

Print "Yes" if the robot will be located at (a, b), and "No" otherwise.

Examples

Input

2 2
RU


Output

Yes


Input

1 2
RU


Output

No


Input

-1 1000000000
LRRLU


Output

Yes


Input

0 0
D


Output

Yes

Note

In the first and second test case, command string is "RU", so the robot will go right, then go up, then right, and then up and so on.

The locations of its moves are (0, 0)  →  (1, 0)  →  (1, 1)  →  (2, 1)  →  (2, 2)  →  ...

So it can reach (2, 2) but not (1, 2).
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C {
	
	public static void main(String[] args) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int a = sc.nextInt(), b = sc.nextInt();
		if(a == 0 && b == 0) {out.println("Yes"); out.flush(); return;}
		char[] c = sc.next().toCharArray();
		int n = c.length;
		Point[] p = new Point[2 * n];
		Point cur = new Point(0, 0);
		for(int i = 0; i < n; i++)
		{
			if(c[i] == 'U') cur.y++;
			else if(c[i] == 'R') cur.x++;
			else if(c[i] == 'D') cur.y--;
			else cur.x--;
			p[i] = new Point(cur.x, cur.y);
			if(p[i].x == a && p[i].y == b){out.println("Yes"); out.flush(); return;}
		}
		for(int i = 0; i < n; i++)
		{
			if(c[i] == 'U') cur.y++;
			else if(c[i] == 'R') cur.x++;
			else if(c[i] == 'D') cur.y--;
			else cur.x--;
			p[i + n] = new Point(cur.x, cur.y);
			if(p[i + n].x == a && p[i + n].y == b){out.println("Yes"); out.flush(); return;}

		}
		for(int i = 0; i < n; i++)
		{
			if(check(p[i], p[i + n], a, b))
			{
				out.println("Yes");
				out.flush();
				return;
			}
		}
		out.println("No");
		out.flush();
		out.close();
	}
	
	static boolean check(Point p1, Point p2, int x, int y)
	{
		if(p1.x == p2.x && p1.y == p2.y) 
			return false;
		if(1l * (y - p2.y) * (p1.x - p2.x) == 1l * (x - p2.x) * (p1.y - p2.y))
		{
			int diffX = p2.x - p1.x, diffY = p2.y - p1.y;
			int bsx = BS(diffX, x - p1.x), bsy = BS(diffY, y - p1.y);
			if(diffX == 0) bsx = bsy;
			if(diffY == 0) bsy = bsx;
			if(bsx != -1 && bsy != -1 && bsx == bsy)
				return true;
		}
		return false;
	}
	
	static int BS(int diff, int t)
	{
		int lo = 0, hi = 1000000000;
		while(lo <= hi)
		{
			int mid = (lo + hi) / 2;
			if(1l * diff * mid == t)
				return mid;
			if(1l * diff * mid < t && t >= 0)
				lo = mid + 1;
			else if(1l * diff * mid < t && t < 0)
				hi = mid - 1;
			else if(1l * diff * mid > t && t >= 0)
				hi = mid - 1;
			else if(1l * diff * mid > t && t < 0)
				lo = mid + 1;
		}
		return -1;
	}
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream system) {br = new BufferedReader(new InputStreamReader(system));}
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public String nextLine()throws IOException{return br.readLine();}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		public double nextDouble() throws IOException {return Double.parseDouble(next());}
		public char nextChar()throws IOException{return next().charAt(0);}
		public Long nextLong()throws IOException{return Long.parseLong(next());}
		public boolean ready() throws IOException{return br.ready();}
		public void waitForInput(){for(long i = 0; i < 3e9; i++);}
	}
}