#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, t, sum = 0, ans = 0, pos = 0;
  cin >> n >> t;
  vector<long long> a(n, 0);
  multiset<long long> s;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    s.insert(a[i]);
    sum += a[i];
  }
  while (!s.empty()) {
    if (sum <= t) {
      ans += (t / sum) * ((long long)s.size());
      t %= sum;
    } else {
      multiset<long long>::iterator it = s.end();
      --it;
      if ((*it) <= t) {
        if ((s.find(a[pos]) != s.end()) && (a[pos] <= t)) {
          ans++;
          t -= a[pos];
          pos++;
          if (pos == n) pos = 0;
        } else {
          pos++;
          if (pos == n) pos = 0;
        }
        continue;
      }
      sum -= (*it);
      s.erase(it);
    }
  }
  cout << ans << "\n";
  return 0;
}
