T1
#include <iostream>
using namespace std;
int main() {
int a, x, y;
cin >> a >> x >> y;
cout << x + y << " " << (x + y)*a - x;
return 0;
}
T2
#include <bits/stdc++.h>
using namespace std;
long long t,last=0;
int a[100100];
int main() {
int n,d;
cin>>n>>d;
for (int i=0;i<n;i++){
cin>>a[i];
}
last=a[0];
for (int i=0;i<n;i++){
if (a[i]-last<=d){
t+=a[i]-last;
last=a[i];
}else {
last=a[i];
t+=d;
}
}
cout<<t+d;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
string a;
long long k;
int main() {
cin>>a;
for (int i=0;i<a.length();i++){
k+=a[i]-'0';
}
while (k/10>0){
long long cmp=k;
k=0;
while(cmp!=0){
k+=cmp%10;
cmp/=10;
}
}
cout<<k;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
long long a[200100],q[200100],cnt[200100],ans;
int main(){
int n,k;
cin>>n>>k;
for (int i=1;i<=n;i++){
cin>>a[i];
q[i]=(q[i-1]+a[i])%k;
ans+=cnt[q[i]];
cnt[q[i]]++;
}
cout<<ans+cnt[0];
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int a[100100],b[100100],qa[100100],qb[100100];
int n,t,cnt;
int main() {
cin>>n>>t;
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
qa[i]=qa[i-1]+a[i];
}
for (int i=1;i<=n;i++){
scanf("%d",&b[i]);
qb[i]=qb[i-1]+b[i];
}
int w=n;
for (int i=0;i<=n;i++){
for (int j=w;j>=0;j--){
if (qa[i]+qb[j]<=t){
cnt=max(i+j,cnt);
w=j;
break;
}
}
}
printf("%d",cnt);
return 0;
}