#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++) 
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define vi vector<int>
using namespace std;
const int N = 5e5 + 7, inf = 1e9 + 7;
int n, a[N];	
ll m;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, 100) {
		int k = (100 + n) * i / 100;
		a[k] = true;
	}
	ll all = n + 100, o = (m - 1) / n, cnt = m - o * n, ns = o * all; 
	L(i, 1, all) if(!a[i] && cnt) 
		ns = o * all + i, --cnt;
	cout << ns << "\n";
	return 0;
}
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;

#define all(a) (a).begin(), (a).end()

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll t, n; cin>>t>>n;

    if((100 * n) % t == 0){
        cout << (100 * n) / t + (100 * n) / t * t / 100 - 1 << endl;
    }
    else{
        cout << (100 * n) / t + (100 * n) / t * t / 100 + 1 << endl;
    }

    return 0;
}