#include <bits/stdc++.h>

using namespace std;
// #pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,avx,avx2,tune=native")
// #pragma GCC optimaze("O3")
// #pragma GCC optimaze("unroll-loops")

#define int long long
typedef long long ll;

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

int mod = 1e9 + 7;

ll mul(ll a, ll b) {
    return (a * b) % mod;
}

int pw(int a, int k) {
    if (k == 0) return 1;
    if (k % 2) return mul(pw(a, k - 1), a);
    return pw(mul(a, a), k / 2);
}

int sm(int a, int b) {
    if (a + b < mod) return a + b;
    return a + b - mod;
}
int df(int a, int b) {
    if (a >= b) return a - b;
    return a + mod - b;
}


int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    int n; cin >> n;

    int A = (n * 100 + t - 1) / t;
    cout << ((A * (100 + t)) / 100) - 1 << endl;



    return 0;
}

#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <string>
#include <numeric>
#include <iterator>
#include <climits>

using namespace std;

template <class T>
ostream &operator<<(ostream &o, const vector<T> &v)
{
  o << "{";
  for (int i = 0; i < (int)v.size(); i++)
    o << (i > 0 ? ", " : "") << v[i];
  o << "}";
  return o;
}

int main()
{
  int n;
  cin >> n;
  long long res = 0;

  while (n > 0)
  {
    long long a, b;
    cin >> a >> b;
    long long sum = (b - a + 1) * (a + b) / 2;//(100000-1+1)*(1+1000000)/2
    res += sum;
    // cout << "n: " << n << " sum: " << sum << endl;
    n--;
  }
  cout << res;
  return 0;
}