#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
ll i,j,k,a,b,c;
ll T,m;
ll t[10005],v[10005],f[100005];
int main()
{
	cin>>a>>b;
	if(b%a==0) 
	{
		cout<<"Yes";
		return 0;
	}
	else cout<<"No";
	return 0;
}






#include <bits/stdc++.h>

#define ig  cin.ignore(numeric_limits<streamsize>::max(), '\n');
using namespace std;

int binarySearch(long long int arr[], int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;
 
        if (arr[mid] == x)
            return mid;
 
        
        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
 
    
        return binarySearch(arr, mid + 1, r, x);
    }
 
    
    return -1;
}





void solve()
{
    int a,b,sum=0;
    cin>>a>>b;
    for(int i=1;i<=a;i++)
        for(int j=1;j<=b;j++)
            sum+=(i*100)+j;
    cout<<sum<<endl;
}


int main(){
    //int t;cin>>t;
 //   while(t--){
        solve();
  //  }
    return 0;
}