#include<cstdio>
using namespace std;

int main() {
	printf("hello world");
	return 0;
}

#include<iostream>
#include<cstring>
using namespace std;
int main(){
	char arr[1000];
	int m=0,n=1000;
	gets(arr);
	for(int i=0;arr[i]!='\0';i++){
		if(arr[i]==' '){
			n=i;
			cout<<n-m<<",";
			m=n+1;
		}
	}
	cout<<strlen(arr)-m;
	return 0;
}

https://oi-wiki.org/dp/plug/

#include<bits/stdc++.h>
using namespace std;
int main(){
	int m;
	cin>>m;
	int s=0;
	for(int i=0;i<m;i++){
		s=s+i;
		if(s>m){
			cout<<i;
			break;
		}
	}
	return 0;
}

#include<bits/stdc++.h> using namespace std; int main(){ int m; cin>>m; int s=0; for(int i=0;i<m;i++){ s=s+i; if(s>m){ cout<<i; break; } } return 0; }

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
string a,b;

bool bj(string a,string b,int i){
    int flag =0;
    for(int j=0;j<a.size();j++){
        if(a[j]!=b[i]){
            flag = 1;
            return false;
        }
        i++;
    }
    if(flag==0){
        return true;
    }
    
}

int main(){
    cin>>a>>b;
    if(a.size()<=b.size())
    {
        int flag = 0;
        int n = b.size()-a.size()+1;
        for(int i=0;i<=n-1;i++){
            if(bj(a,b,i)){
                flag = 1;
                cout<<a<<" is substring of "<<b;
            }
        }
        if(flag == 0){
            cout<<"No substring";
        }
    }else{
        int flag = 0;
        int n = a.size()-b.size()+1;
        for(int i=0;i<=n-1;i++){
            if(bj(b,a,i)){
                flag = 1;
                cout<<b<<" is substring of "<<a;
            }
        }
        if(flag == 0){
            cout<<"No substring";
        }
    }
    return 0;
}

#include<iostream>
#include<cstring>
using namespace std;
int main(){
	char a[200];
	int i; 
	cin>>a;
	for(i=0;a[i]!='\0';i++){
		if(a[i]>='a'&&a[i]<='w') a[i]+=3;
		else if(a[i]>='A'&&a[i]<='W') a[i]+=3;
		else if(a[i]>='x'&&a[i]<='z') a[i]-=23;
		else if(a[i]>='X'&&a[i]<='Z') a[i]-=23;
	}
	cout<<a;
	return 0;
}

#include<bits/stdc++.h> using namespace std; const int N = 1e6+10; int q[N]; int k[N]; int a[N]; int b[N]; int main(){ int x,y,n; cin>>n>>x>>y; for(int i=1;i<=n;i++) cin>>k[i]; b[x]=1; q[1]=x; int ll=0;rr=1; do{ ll++; for(int i=-1;i<=1;i+=2){ int newlou=q[ll]+k[q[ll]]*i; if(newlou>0&&newlou<=n&&!b[newlou]){ rr++; q[rr]=newlou; b[newlou]=1; a[rr]=a[ll]+1; } } }while(ll!=rr&&q[ll]!=y); if(x==y)cout<<0<<endl; else if(q[11]==y)cout<<a[ll]<<endl; else cout<<-1<<endl; return 0; }

#include<bits/stdc++.h>
using namespace std;
int a[1000];
int main(){
	int n,m,k,b;
	cin>>n>>m;
	k=n;
	b=0;
	for(int i=1;i<=n;i++){
		a[i]=1;
	}
	for(int i=1;i<=n;i++){
		if(a[i]==1){
			b++;
			if(b==m){
				a[i]=0;
				k--;
				b=0;
			}
		}
		if(i==n){
			i=0;
		}
		if(k==1){
			break; 
		}
	}
	for(int i=1;i<=n;i++){
		if(a[i]==1){
			cout<<i;
		}
	}
	return 0;
}