92pts，求条

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
int const N = 1e5 + 7;
ll a[N], s[N];
int n;
ll k, p;

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

  cin >> n >> k >> p;
  for(int i = 1; i <= n; i++){
    cin >> a[i];
    s[i] = (s[i - 1] + a[i] % p) % p;
  }

  set<ll> st;
  st.insert(0); 
  ll ans = LLONG_MAX;

  for(int j = 1; j <= n; j++){
    ll target = s[j] - k;
    auto it = st.upper_bound(target);
    if(it != st.begin()){
      it--;
      ll val = (s[j] - *it + p) % p;
      if(val >= k) ans = min(ans, val);
    }

    if(!st.empty()){
      ll val = (s[j] - *st.begin() + p) % p;
      if(val >= k) ans = min(ans, val);
    }
    
    st.insert(s[j]);
  }

  cout << ans << "\n";
  return 0;
}


// author: Kasty