include<stdio.h>

include<math.h>

include<string.h>

include <stdbool.h>

define ll long long

#define For(i,a,b) \
int i; \
for(i=a;i<b;i++)
bool isPrime(int n){
if(n<2) return false;
For(i,2,sqrt(n)){
if(n%i==0) return false;
}
return true;
}
ll giaithua(ll n){
ll count=1;
n++;
while(n--){
count=n==0?1:n;
}
// printf("%lld\n",count);
return count;
}
void solve(){
// double n,m;
ll n,m,k=0;
// char n[10];
ll a[4],b=0,c;
scanf("%lld %lld %lld",&a[0],&a[1],&a[2]);
For(i,0,3){
For(j,i,3)
if(a[i]>a[j]){
int cmp=a[i];
a[i]=a[j];
a[j]=cmp;
}
}
// m=n;
// printf("%lld\n",n);
printf("%lld\n",a[2]-a[1]+2(a[1]-a[0]));
// printf("%lld\n",a);
}
int main(){
// int t;
// scanf("%d",&t);
// while(t--)
solve();
}

noob
that's it 😀

Helooo everyone

N,M,S=map(int,input().split())
p=[]
for i in range(M):
x,y=map(int,input().split())
p.append([x,y])
bruh=[[] for i in range(N)]
for i in range(M):
bruh[p[i][0]-1].append(p[i][1])
bruh[p[i][1]-1].append(p[i][0])
visit=[False]*N
d=[[0,0] for i in range(N)]
d[S-1][1]=S-1
def bfs(x):
global visit,bruh,d
q=[x]
visit[x-1]=True
while len(q):
for i in q:
u=q.pop(0)
for j in bruh[u-1]:
if not visit[j-1]:
visit[j-1]=True
d[j-1][0]=d[u-1][0]+1
d[j-1][1]=j
print(d)
q.append(j)
d.sort()
for i in d:
if not(i[0]==i[1]==0):
print(i[1],i[0])
bfs(S)